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 8, 2026 16:51Victor MerckléVictor MerckléScore: 36,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 16:5536,565311,992,047299,055,0004,437,0002,117,632stderr
2Sep 8, 2026 16:5536,650312,796,973299,842,0004,360,00024,576stderr
3Sep 8, 2026 16:5536,703313,278,777300,370,0004,268,00024,576stderr
4Sep 8, 2026 16:5536,729313,447,168300,509,0004,348,0002,117,632stderr
5Sep 8, 2026 16:5536,756314,439,647300,116,0004,960,00024,576stderr
6Sep 8, 2026 16:5536,765314,400,121301,141,0004,013,00024,576stderr
7Sep 8, 2026 16:5536,781313,602,102300,949,0004,341,00024,576stderr
8Sep 8, 2026 16:5536,823314,377,006301,306,0004,330,00024,576stderr
9Sep 8, 2026 16:5536,858315,033,683301,622,0004,302,0002,117,632stderr