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 23:04Victor MerckléVictor MerckléScore: 3,849Success
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 23:053,79839,863,23530,436,0001,092,0002,117,632stderr
2Aug 26, 2026 23:053,82140,892,98030,537,0001,181,0002,117,632stderr
3Aug 26, 2026 23:053,83040,159,25430,678,0001,118,0002,117,632stderr
4Aug 26, 2026 23:053,83340,191,54030,725,0001,090,0002,117,632stderr
5Aug 26, 2026 23:053,84940,319,36330,886,0001,068,0002,117,632stderr
6Aug 26, 2026 23:053,85241,095,10830,777,0001,195,0002,117,632stderr
7Aug 26, 2026 23:053,88940,626,79231,217,0001,062,0002,117,632stderr
8Aug 26, 2026 23:053,96741,822,70731,728,0001,204,0002,117,632stderr
9Aug 26, 2026 23:054,02851,650,61232,168,0001,272,0002,117,632stderr