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 11, 2026 20:30Victor MerckléVictor MerckléScore: 10,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 20:3310,04193,119,61382,193,0001,153,0002,117,632stderr
2Sep 11, 2026 20:3310,04393,712,41882,225,0001,133,0002,117,632stderr
3Sep 11, 2026 20:3310,06193,309,49982,353,0001,155,0002,117,632stderr
4Sep 11, 2026 20:3310,06293,656,28382,345,0001,174,0002,117,632stderr
5Sep 11, 2026 20:3310,07293,399,69182,592,0001,007,0002,117,632stderr
6Sep 11, 2026 20:3310,07493,442,86182,474,0001,148,0002,117,632stderr
7Sep 11, 2026 20:3310,08693,523,42482,581,0001,141,0002,117,632stderr
8Sep 11, 2026 20:3310,08994,293,38082,617,0001,123,0002,117,632stderr
9Sep 11, 2026 20:3310,14298,577,20883,109,0001,071,0002,117,632stderr