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 09:30Victor MerckléVictor MerckléScore: 4,713Success
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 09:324,68947,702,11237,853,0001,072,0002,113,536
2May 21, 2026 09:324,69847,278,81537,929,0001,065,0002,113,536
3May 21, 2026 09:324,70547,550,98038,021,0001,032,0002,113,536
4May 21, 2026 09:324,71251,135,59138,081,0001,033,0002,113,536
5May 21, 2026 09:324,71349,122,36238,026,0001,094,0002,113,536
6May 21, 2026 09:324,72449,058,74738,149,0001,068,0002,113,536
7May 21, 2026 09:324,73347,957,69838,268,0001,019,0002,113,536
8May 21, 2026 09:324,76450,338,06238,473,0001,069,0002,113,536
9May 21, 2026 09:324,79850,665,16338,818,0001,006,0002,113,536