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 listJun 29, 2026 18:21Victor MerckléVictor MerckléScore: 4,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 18:224,18742,582,91533,709,0001,048,0002,117,632stderr
2Jun 29, 2026 18:224,23543,055,78234,063,0001,089,0002,117,632stderr
3Jun 29, 2026 18:224,26943,390,12434,307,0001,133,0002,117,632stderr
4Jun 29, 2026 18:224,29043,455,84634,552,0001,060,0002,117,632stderr
5Jun 29, 2026 18:224,39945,771,71735,415,0001,102,0002,117,632stderr
6Jun 29, 2026 18:224,44844,789,60235,835,0001,084,0002,117,632stderr
7Jun 29, 2026 18:224,47345,006,30236,124,0001,007,0002,117,632stderr
8Jun 29, 2026 18:224,51445,342,15436,324,0001,149,0002,117,632stderr
9Jun 29, 2026 18:224,54745,628,73136,686,0001,058,0002,117,632stderr