Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJan 22, 2025 13:59Uladzislau NestsiarukUladzislau NestsiarukScore: 95,901Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 13:5995,642819,095,847733,842,00059,987,0002,289,664
2Jan 22, 2025 13:5995,676815,062,058740,105,00054,007,0002,289,664
3Jan 22, 2025 13:5995,688824,946,087736,195,00058,015,0002,277,376
4Jan 22, 2025 13:5995,893825,167,947735,919,00059,993,0002,277,376
5Jan 22, 2025 13:5995,901819,519,582735,982,00059,998,0002,277,376
6Jan 22, 2025 13:5995,930826,068,818730,201,00066,018,0002,289,664
7Jan 22, 2025 13:5995,972823,724,586731,606,00064,965,0002,289,664
8Jan 22, 2025 13:5995,980820,617,443734,662,00061,971,0002,289,664
9Jan 22, 2025 13:5996,016820,311,774743,936,00052,995,0002,281,472