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 24, 2026 18:34Victor MerckléVictor MerckléScore: 4,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:354,51145,062,64136,334,0001,114,0002,117,632stderr
2Jun 24, 2026 18:354,51245,098,11436,352,0001,100,0002,117,632stderr
3Jun 24, 2026 18:354,52545,123,10636,463,0001,095,0002,117,632stderr
4Jun 24, 2026 18:354,53245,241,68636,495,0001,122,0002,117,632stderr
5Jun 24, 2026 18:354,54545,340,63936,684,0001,047,0002,117,632stderr
6Jun 24, 2026 18:354,73346,909,76538,178,0001,107,0002,117,632stderr
7Jun 24, 2026 18:354,74147,325,03038,210,0001,142,0002,117,632stderr
8Jun 24, 2026 18:354,74746,998,03438,268,0001,138,0002,117,632stderr
9Jun 24, 2026 18:354,92550,113,13239,755,0001,129,0002,117,632stderr