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 listJul 6, 2026 22:26Victor MerckléVictor MerckléScore: 6,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:296,62062,858,22753,824,0001,127,0002,117,632stderr
2Jul 6, 2026 22:296,62862,934,93253,941,0001,076,0002,117,632stderr
3Jul 6, 2026 22:296,62863,004,68353,920,0001,097,0002,117,632stderr
4Jul 6, 2026 22:296,64063,150,80454,099,0001,014,0002,117,632stderr
5Jul 6, 2026 22:296,65763,251,31054,162,0001,095,0002,117,632stderr
6Jul 6, 2026 22:296,67663,467,24354,222,0001,193,0002,117,632stderr
7Jul 6, 2026 22:296,68564,118,51254,470,0001,019,0002,117,632stderr
8Jul 6, 2026 22:296,70263,820,46154,464,0001,163,0002,117,632stderr
9Jul 6, 2026 22:296,81164,482,89155,527,0001,008,0002,117,632stderr