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 18:03Josu San MartinJosu San MartinScore: 6,941Success
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 18:036,88690,005,70556,151,0001,002,0002,469,888
2Jan 2, 2026 18:036,93380,794,10656,535,0001,009,0002,371,584
3Jan 2, 2026 18:036,94087,417,65956,593,0001,010,0002,359,296
4Jan 2, 2026 18:036,94181,963,30956,604,0001,010,0002,277,376
5Jan 2, 2026 18:036,94880,393,92757,668,00002,367,488
6Jan 2, 2026 18:036,96387,488,93355,802,0001,992,0002,371,584