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 listSep 30, 2026 19:43Karthik ReddyKarthik ReddyScore: 3,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 19:443,40937,267,70828,301,00002,138,112
2Sep 30, 2026 19:443,41837,320,43328,375,00002,138,112
3Sep 30, 2026 19:443,42337,406,84028,411,00002,138,112
4Sep 30, 2026 19:443,42337,376,45328,414,00002,138,112
5Sep 30, 2026 19:443,42337,392,71028,413,00002,138,112
6Sep 30, 2026 19:443,42637,405,57628,438,00002,138,112
7Sep 30, 2026 19:443,43437,418,27328,508,00002,138,112
8Sep 30, 2026 19:443,43537,423,88428,518,00002,138,112
9Sep 30, 2026 19:443,44637,565,07228,610,00002,138,112