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 listJun 10, 2026 02:41Victor MerckléVictor MerckléScore: 4,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 02:434,88048,055,38539,470,0001,034,0002,138,112
2Jun 10, 2026 02:434,88348,058,20039,487,0001,044,0002,138,112
3Jun 10, 2026 02:434,88348,233,81039,503,0001,033,0002,138,112
4Jun 10, 2026 02:434,88448,067,11039,513,0001,028,0002,138,112
5Jun 10, 2026 02:434,88548,116,30639,497,0001,049,0002,138,112
6Jun 10, 2026 02:434,89648,328,02839,594,0001,050,0002,138,112
7Jun 10, 2026 02:434,89848,236,72739,630,0001,029,0002,138,112
8Jun 10, 2026 02:434,90548,433,46739,682,0001,030,0002,138,112
9Jun 10, 2026 02:434,90748,830,98039,691,0001,045,0002,138,112