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 15, 2026 14:44Victor MerckléVictor MerckléScore: 6,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 14:446,97366,394,68056,877,0001,007,0002,113,536
2May 15, 2026 14:446,97865,840,79457,925,00002,113,536
3May 15, 2026 14:446,98367,304,53656,955,0001,009,0002,113,536
4May 15, 2026 14:446,98567,241,97856,975,0001,001,0002,113,536
5May 15, 2026 14:446,98665,560,54656,985,0001,004,0002,113,536
6May 15, 2026 14:446,99665,357,29057,055,0001,017,0002,113,536
7May 15, 2026 14:447,03267,480,16757,357,0001,009,0002,113,536
8May 15, 2026 14:447,04368,613,98157,423,0001,038,0002,113,536
9May 15, 2026 14:447,10366,683,86657,942,0001,017,0002,113,536