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 2, 2026 03:46Victor MerckléVictor MerckléScore: 4,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 03:474,18642,515,85933,632,0001,116,0002,117,632stderr
2Jul 2, 2026 03:474,20042,736,39133,769,0001,099,0002,117,632stderr
3Jul 2, 2026 03:474,20642,721,06033,841,0001,075,0002,117,632stderr
4Jul 2, 2026 03:474,22742,951,08234,050,0001,035,0002,117,632stderr
5Jul 2, 2026 03:474,23542,856,84734,049,0001,109,0002,117,632stderr
6Jul 2, 2026 03:474,24643,052,20934,187,0001,056,0002,117,632stderr
7Jul 2, 2026 03:474,32843,826,37334,805,0001,121,0002,117,632stderr
8Jul 2, 2026 03:474,33343,751,91434,840,0001,128,0002,117,632stderr
9Jul 2, 2026 03:474,64146,261,25037,489,0001,035,0002,117,632stderr