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 20, 2026 01:33avoidcatenjoyersavoidcatenjoyersScore: 111,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 01:33111,880938,196,517869,824,00058,782,0002,113,536
2May 20, 2026 01:33111,925938,983,418870,385,00058,596,0002,113,536
3May 20, 2026 01:33111,927938,533,869870,234,00058,762,0002,113,536
4May 20, 2026 01:33111,954941,524,789870,736,00058,486,0002,113,536
5May 20, 2026 01:33111,972941,970,514870,375,00058,993,0002,113,536
6May 20, 2026 01:33112,007939,276,916870,866,00058,797,0002,113,536
7May 20, 2026 01:33112,088940,559,601871,344,00058,993,0002,113,536
8May 20, 2026 01:33112,113939,951,324871,965,00058,580,0002,113,536
9May 20, 2026 01:33112,181942,580,736872,280,00058,824,0002,113,536