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 listMay 14, 2026 06:19Victor MerckléVictor MerckléScore: 7,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 06:197,07565,957,86857,654,0001,071,0002,113,536
2May 14, 2026 06:197,07766,393,39357,647,0001,094,0002,113,536
3May 14, 2026 06:197,08567,918,53157,696,0001,110,0002,113,536
4May 14, 2026 06:197,09366,552,91757,821,0001,054,0002,113,536
5May 14, 2026 06:197,09668,998,67257,783,0001,114,0002,113,536
6May 14, 2026 06:197,09668,093,05357,774,0001,124,0002,113,536
7May 14, 2026 06:197,10766,260,40957,862,0001,134,0002,113,536
8May 14, 2026 06:197,11966,411,83858,043,0001,052,0002,113,536
9May 14, 2026 06:197,14069,564,07358,176,0001,093,0002,113,536