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 listOct 19, 2026 17:04DanielDanielScore: 14,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 17:0414,574131,903,353115,522,0005,444,00024,576
2Oct 19, 2026 17:0414,668132,649,029116,523,0005,226,0002,117,632
3Oct 19, 2026 17:0414,824133,863,893118,797,0004,246,0002,117,632
4Oct 19, 2026 17:0414,868134,221,624115,482,0007,923,00024,576
5Oct 19, 2026 17:0414,880134,455,056116,299,0007,208,0002,117,632
6Oct 19, 2026 17:0414,918134,747,716119,057,0004,766,00024,576
7Oct 19, 2026 17:0414,925134,707,363119,260,0004,624,00024,576
8Oct 19, 2026 17:0414,941134,936,250119,255,0004,761,00024,576
9Oct 19, 2026 17:0415,034135,602,950119,368,0005,417,00024,576