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:04Victor MerckléVictor MerckléScore: 22,175Success
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:0522,005192,426,553181,590,0001,054,0002,117,632stderr
2Sep 16, 2026 19:0522,092193,211,085182,305,0001,065,0002,117,632stderr
3Sep 16, 2026 19:0522,103193,297,117182,410,0001,050,0002,117,632stderr
4Sep 16, 2026 19:0522,172194,059,464182,984,0001,045,0002,117,632stderr
5Sep 16, 2026 19:0522,175193,868,408183,007,0001,048,0002,117,632stderr
6Sep 16, 2026 19:0522,233194,429,092183,500,0001,035,0002,117,632stderr
7Sep 16, 2026 19:0522,476196,493,114185,506,0001,049,0002,117,632stderr
8Sep 16, 2026 19:0522,505196,627,824185,746,0001,051,0002,117,632stderr
9Sep 16, 2026 19:0522,543196,915,862186,055,0001,058,0002,117,632stderr