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 30, 2026 20:23Josu San MartinJosu San MartinScore: 4,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:254,29444,077,10734,609,0001,038,0002,113,536
2Aug 30, 2026 20:254,29844,109,83134,636,0001,042,0002,113,536
3Aug 30, 2026 20:254,30344,156,59334,667,0001,049,0002,113,536
4Aug 30, 2026 20:254,30744,155,15634,709,0001,046,0002,113,536
5Aug 30, 2026 20:254,30844,205,41034,716,0001,045,0002,113,536
6Aug 30, 2026 20:254,31944,295,42834,739,0001,111,0002,113,536
7Aug 30, 2026 20:254,32644,363,14434,845,0001,069,0002,113,536
8Aug 30, 2026 20:254,32944,489,36834,816,0001,115,0002,113,536
9Aug 30, 2026 20:254,37444,679,32835,186,0001,122,0002,113,536