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 16, 2026 21:52Victor MerckléVictor MerckléScore: 48,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 21:5448,063408,873,318397,906,0001,019,0002,117,632stderr
2Sep 16, 2026 21:5448,448412,033,381401,053,0001,071,0002,117,632stderr
3Sep 16, 2026 21:5448,469412,114,801401,271,0001,023,0002,117,632stderr
4Sep 16, 2026 21:5448,543412,696,188401,891,0001,024,0002,117,632stderr
5Sep 16, 2026 21:5448,555413,138,736401,907,0001,106,0002,117,632stderr
6Sep 16, 2026 21:5448,608413,446,295402,354,0001,098,0002,117,632stderr
7Sep 16, 2026 21:5448,639414,850,646402,656,0001,052,0002,117,632stderr
8Sep 16, 2026 21:5448,722414,323,035403,399,0001,000,0002,117,632stderr
9Sep 16, 2026 21:5448,817414,940,941404,073,0001,111,0002,117,632stderr