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 21, 2026 15:34Victor MerckléVictor MerckléScore: 4,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 15:354,62246,543,15537,284,0001,083,0002,113,536
2May 21, 2026 15:354,62346,387,19637,294,0001,078,0002,113,536
3May 21, 2026 15:354,62846,350,37937,341,0001,072,0002,113,536
4May 21, 2026 15:354,64846,489,33237,506,0001,077,0002,113,536
5May 21, 2026 15:354,64848,658,29537,555,0001,026,0002,113,536
6May 21, 2026 15:354,65246,409,70437,587,0001,031,0002,113,536
7May 21, 2026 15:354,65547,385,50237,588,0001,055,0002,113,536
8May 21, 2026 15:354,84948,086,88439,194,0001,056,0002,113,536
9May 21, 2026 15:355,07549,976,33940,992,0001,136,0002,113,536