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 19:19Victor MerckléVictor MerckléScore: 28,483Success
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 19:2127,729241,250,498229,064,0001,087,0002,117,632stderr
2Sep 16, 2026 19:2127,765240,233,705229,381,0001,069,0002,117,632stderr
3Sep 16, 2026 19:2128,286244,681,827233,769,0001,010,0002,117,632stderr
4Sep 16, 2026 19:2128,356245,135,979234,304,0001,056,0002,117,632stderr
5Sep 16, 2026 19:2128,483246,172,984235,362,0001,055,0002,117,632stderr
6Sep 16, 2026 19:2128,696248,007,894237,104,0001,079,0002,117,632stderr
7Sep 16, 2026 19:2128,733249,030,536237,426,0001,065,0002,117,632stderr
8Sep 16, 2026 19:2128,859249,316,548238,507,0001,024,0002,117,632stderr
9Sep 16, 2026 19:2129,675256,088,434245,296,0001,009,0002,117,632stderr