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 listMay 24, 2026 20:05Maya RebholzMaya RebholzScore: 7,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:067,08269,894,63653,615,0005,169,0002,113,536
2May 24, 2026 20:067,09469,380,59753,505,0005,382,0002,117,632
3May 24, 2026 20:067,20270,875,98554,626,0005,151,0002,117,632
4May 24, 2026 20:067,20872,293,77454,184,0005,649,0002,113,536
5May 24, 2026 20:067,21171,608,99954,639,0005,215,0002,113,536
6May 24, 2026 20:067,27869,838,08954,999,0005,412,0002,117,632
7May 24, 2026 20:067,28270,314,39455,134,0005,310,0002,113,536
8May 24, 2026 20:067,33473,123,39055,673,0005,204,0002,113,536
9May 24, 2026 20:067,38771,131,12455,655,0005,660,0002,117,632