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:33Victor MerckléVictor MerckléScore: 4,208Success
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:344,18742,464,58333,629,0001,131,0002,117,632stderr
2Jul 2, 2026 03:344,18842,561,84333,632,0001,135,0002,117,632stderr
3Jul 2, 2026 03:344,19642,664,19833,729,0001,098,0002,117,632stderr
4Jul 2, 2026 03:344,20042,601,68533,777,0001,089,0002,117,632stderr
5Jul 2, 2026 03:344,20842,694,30033,841,0001,093,0002,117,632stderr
6Jul 2, 2026 03:344,21942,872,74033,916,0001,108,0002,117,632stderr
7Jul 2, 2026 03:344,22542,850,48933,997,0001,072,0002,117,632stderr
8Jul 2, 2026 03:344,22842,958,01934,083,0001,016,0002,117,632stderr
9Jul 2, 2026 03:344,23842,921,31034,160,0001,016,0002,117,632stderr