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 2, 2026 01:43zielajzielajScore: 3,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2026 01:433,42851,844,93427,437,0001,016,0002,523,136
2Apr 2, 2026 01:433,43651,100,56327,497,0001,018,0002,433,024
3Apr 2, 2026 01:433,43951,712,51027,528,0001,019,0002,519,040
4Apr 2, 2026 01:433,64752,218,03129,264,0001,009,0002,510,848
5Apr 2, 2026 01:433,65152,751,61729,293,0001,010,0002,433,024
6Apr 2, 2026 01:433,65560,867,38729,329,0001,011,0002,510,848