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 8, 2026 11:23Victor MerckléVictor MerckléScore: 63,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 11:2463,897538,431,075529,237,0001,111,0002,117,632stderr
2Jul 8, 2026 11:2463,907538,545,741529,293,0001,140,0002,117,632stderr
3Jul 8, 2026 11:2463,925538,619,651529,548,0001,036,0002,117,632stderr
4Jul 8, 2026 11:2463,934538,740,684529,613,0001,040,0002,117,632stderr
5Jul 8, 2026 11:2463,944538,842,319529,618,0001,122,0002,117,632stderr
6Jul 8, 2026 11:2464,219541,289,309531,933,0001,091,0002,117,632stderr
7Jul 8, 2026 11:2464,310541,962,686532,763,0001,013,0002,117,632stderr
8Jul 8, 2026 11:2464,333542,160,208532,950,0001,015,0002,117,632stderr
9Jul 8, 2026 11:2464,748545,545,226536,392,0001,017,0002,117,632stderr