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 listJul 16, 2026 08:05wnwnScore: 3,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 08:063,70338,828,89129,700,0001,039,0002,113,536
2Jul 16, 2026 08:063,70638,890,24029,744,0001,020,0002,113,536
3Jul 16, 2026 08:063,71839,042,36729,821,0001,040,0002,113,536
4Jul 16, 2026 08:063,76639,369,34930,259,0001,002,0002,113,536
5Jul 16, 2026 08:063,83740,430,61130,833,0001,017,0002,113,536
6Jul 16, 2026 08:063,87140,002,18731,101,0001,032,0002,113,536
7Jul 16, 2026 08:063,87840,858,51231,146,0001,047,0002,113,536
8Jul 16, 2026 08:063,88440,958,76731,232,0001,007,0002,113,536
9Jul 16, 2026 08:063,91641,134,12431,485,0001,021,0002,113,536