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 13, 2026 21:20Victor MerckléVictor MerckléScore: 7,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:217,59370,263,99663,025,00002,113,536
2May 13, 2026 21:217,59472,326,83063,031,00002,113,536
3May 13, 2026 21:217,59573,536,21362,038,0001,001,0002,113,536
4May 13, 2026 21:217,59672,794,48663,054,00002,113,536
5May 13, 2026 21:217,60270,769,89362,065,0001,035,0002,113,536
6May 13, 2026 21:217,60772,384,24162,137,0001,003,0002,113,536
7May 13, 2026 21:217,66372,746,73962,606,0001,001,0002,113,536
8May 13, 2026 21:217,70573,533,47062,952,0001,007,0002,113,536
9May 13, 2026 21:217,86473,027,67465,278,00002,113,536