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 listApr 26, 2026 03:02zielajzielajScore: 3,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 03:023,39946,328,49927,208,0001,007,0002,428,928
2Apr 26, 2026 03:023,41645,378,51327,347,0001,012,0002,437,120
3Apr 26, 2026 03:023,46642,300,20526,785,0001,984,0002,519,040
4Apr 26, 2026 03:023,47040,869,16326,820,0001,986,0002,433,024
5Apr 26, 2026 03:023,47448,562,48726,847,0001,988,0002,420,736
6Apr 26, 2026 03:023,51043,211,66227,132,0002,009,0002,428,928
7Apr 26, 2026 03:023,54142,620,81228,379,0001,013,0002,428,928
8Apr 26, 2026 03:023,59345,366,33627,834,0001,988,0002,424,832
9Apr 26, 2026 03:023,64149,401,40130,228,00002,420,736