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 listAug 20, 2026 18:58C21C21Score: 43,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2026 18:5843,179369,134,448357,379,0001,007,0002,113,536
2Aug 20, 2026 18:5843,313369,525,745358,265,0001,236,0002,113,536
3Aug 20, 2026 18:5843,316370,398,104358,266,0001,259,0002,113,536
4Aug 20, 2026 18:5843,321370,287,805358,570,0001,001,0002,113,536
5Aug 20, 2026 18:5843,323370,412,038358,575,0001,009,0002,113,536
6Aug 20, 2026 18:5843,329370,440,982358,636,0001,002,0002,113,536
7Aug 20, 2026 18:5843,345369,816,666358,767,0001,002,0002,113,536
8Aug 20, 2026 18:5843,347370,606,621358,563,0001,221,0002,113,536
9Aug 20, 2026 18:5843,350369,905,521358,565,0001,246,0002,113,536