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 26, 2026 18:27Victor MerckléVictor MerckléScore: 4,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 18:284,06543,515,67732,623,0001,121,0002,113,536
2Aug 26, 2026 18:284,06542,045,95832,627,0001,119,0002,113,536
3Aug 26, 2026 18:284,07242,004,99932,705,0001,096,0002,113,536
4Aug 26, 2026 18:284,07542,063,32232,694,0001,130,0002,113,536
5Aug 26, 2026 18:284,08342,972,85832,693,0001,200,0002,113,536
6Aug 26, 2026 18:284,09342,267,42432,820,0001,157,0002,113,536
7Aug 26, 2026 18:284,18943,059,63633,577,0001,198,0002,113,536
8Aug 26, 2026 18:284,19243,843,95833,746,0001,048,0002,113,536
9Aug 26, 2026 18:284,26144,523,16934,290,0001,078,0002,113,536