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 22:58Victor MerckléVictor MerckléScore: 38,569Success
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 22:5938,329328,071,503317,035,0001,098,0002,117,632stderr
2Sep 16, 2026 22:5938,338328,119,549317,113,0001,098,0002,117,632stderr
3Sep 16, 2026 22:5938,507329,426,122318,524,0001,092,0002,117,632stderr
4Sep 16, 2026 22:5938,526329,758,886318,642,0001,125,0002,117,632stderr
5Sep 16, 2026 22:5938,569330,087,935319,094,0001,031,0002,117,632stderr
6Sep 16, 2026 22:5938,572330,561,002319,045,0001,110,0002,117,632stderr
7Sep 16, 2026 22:5938,590330,260,489319,203,0001,101,0002,117,632stderr
8Sep 16, 2026 22:5938,741331,442,737320,451,0001,105,0002,117,632stderr
9Sep 16, 2026 22:5938,856332,355,495321,373,0001,135,0002,117,632stderr