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 13, 2026 17:26Victor MerckléVictor MerckléScore: 3,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 17:323,45339,140,31527,543,0001,122,0002,117,632stderr
2Sep 13, 2026 17:323,45739,088,41027,580,0001,118,0002,117,632stderr
3Sep 13, 2026 17:323,46838,595,67327,656,0001,133,0002,117,632stderr
4Sep 13, 2026 17:323,47038,458,71127,681,0001,127,0002,117,632stderr
5Sep 13, 2026 17:323,48538,721,30527,795,0001,136,0002,117,632stderr
6Sep 13, 2026 17:323,52639,094,49428,123,0001,143,0002,117,632stderr
7Sep 13, 2026 17:323,52739,809,54928,149,0001,129,0002,117,632stderr
8Sep 13, 2026 17:323,52939,711,20728,162,0001,129,0002,117,632stderr
9Sep 13, 2026 17:323,53339,879,38528,208,0001,119,0002,117,632stderr