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 12, 2026 00:58Victor MerckléVictor MerckléScore: 3,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 01:013,68040,897,93829,459,0001,088,0002,117,632stderr
2Sep 12, 2026 01:013,69140,429,04929,537,0001,106,0002,117,632stderr
3Sep 12, 2026 01:013,70641,157,99829,677,0001,091,0002,117,632stderr
4Sep 12, 2026 01:013,73941,422,41329,941,0001,093,0002,117,632stderr
5Sep 12, 2026 01:013,76341,229,51330,147,0001,092,0002,117,632stderr
6Sep 12, 2026 01:013,76941,827,74430,183,0001,107,0002,117,632stderr
7Sep 12, 2026 01:013,77443,005,67130,216,0001,112,0002,117,632stderr
8Sep 12, 2026 01:013,77941,861,56130,264,0001,104,0002,117,632stderr
9Sep 12, 2026 01:013,81342,112,31930,538,0001,114,0002,117,632stderr