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 21, 2026 22:08Kevin HeaveyKevin HeaveyScore: 3,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 22:133,80141,332,17729,370,0002,184,0002,117,632
2Jul 21, 2026 22:133,82841,418,23329,609,0002,167,0002,121,728
3Jul 21, 2026 22:133,83141,418,65029,658,0002,141,0002,121,728
4Jul 21, 2026 22:133,86041,644,11329,872,0002,168,0002,117,632
5Jul 21, 2026 22:133,87841,874,16829,984,0002,210,0002,117,632
6Jul 21, 2026 22:133,87942,420,92529,972,0002,226,0002,117,632
7Jul 21, 2026 22:133,88541,892,86830,110,0002,142,0002,117,632
8Jul 21, 2026 22:133,88841,899,73930,071,0002,205,0002,117,632
9Jul 21, 2026 22:133,89541,982,42530,149,0002,187,0002,117,632