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 listAug 26, 2026 00:38Victor MerckléVictor MerckléScore: 4,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 00:394,19743,226,30133,741,0001,099,0002,117,632stderr
2Aug 26, 2026 00:394,19943,212,89333,763,0001,096,0002,117,632stderr
3Aug 26, 2026 00:394,24244,762,71934,146,0001,068,0002,117,632stderr
4Aug 26, 2026 00:394,26844,368,46334,329,0001,098,0002,117,632stderr
5Aug 26, 2026 00:394,30744,125,11434,634,0001,118,0002,117,632stderr
6Aug 26, 2026 00:394,32744,337,30934,791,0001,130,0002,117,632stderr
7Aug 26, 2026 00:394,36944,653,69935,223,0001,045,0002,117,632stderr
8Aug 26, 2026 00:394,46445,972,34635,988,0001,067,0002,117,632stderr
9Aug 26, 2026 00:394,60247,222,61837,132,0001,068,0002,117,632stderr