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 listMay 9, 2026 19:59Josu San MartinJosu San MartinScore: 4,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 20:004,85156,974,06539,226,0001,044,0002,355,200
2May 9, 2026 20:004,85659,666,92539,277,0001,033,0002,363,392
3May 9, 2026 20:004,85856,333,59939,284,0001,038,0002,342,912
4May 9, 2026 20:004,87357,484,48839,408,0001,042,0002,363,392
5May 9, 2026 20:004,87656,031,62139,247,0001,226,0002,359,296
6May 9, 2026 20:004,91555,581,21339,610,0001,187,0002,347,008
7May 9, 2026 20:004,92855,218,67239,849,0001,054,0002,347,008
8May 9, 2026 20:004,94055,207,59139,979,0001,030,0002,351,104
9May 9, 2026 20:005,17158,706,25341,893,0001,031,0002,347,008