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 2, 2026 17:47Josu San MartinJosu San MartinScore: 6,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 17:476,51184,810,40252,041,0002,001,0002,367,488
2Jan 2, 2026 17:476,52779,320,94652,170,0002,006,0002,281,472
3Jan 2, 2026 17:476,80480,417,71855,464,0001,008,0002,293,760
4Jan 2, 2026 17:476,81591,051,49755,551,0001,010,0002,277,376
5Jan 2, 2026 17:476,87783,436,19855,073,0002,002,0002,289,664
6Jan 2, 2026 17:476,88584,846,64755,144,0002,005,0002,293,760