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 28, 2026 19:43Victor MerckléVictor MerckléScore: 4,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 19:444,90348,534,09039,607,0001,088,0002,113,536
2Jun 28, 2026 19:444,90448,565,89439,631,0001,073,0002,113,536
3Jun 28, 2026 19:444,90548,715,01739,639,0001,074,0002,113,536
4Jun 28, 2026 19:444,91248,456,86439,702,0001,071,0002,113,536
5Jun 28, 2026 19:444,91348,615,93739,706,0001,073,0002,113,536
6Jun 28, 2026 19:444,91648,675,10139,703,0001,102,0002,113,536
7Jun 28, 2026 19:444,92748,605,02139,901,0001,001,0002,113,536
8Jun 28, 2026 19:444,93748,718,95439,896,0001,087,0002,113,536
9Jun 28, 2026 19:444,95348,904,67140,080,0001,036,0002,113,536