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 25, 2026 11:32timothygktimothygkScore: 10,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 11:389,88492,924,96771,397,00010,643,0002,117,632stderr
2Oct 25, 2026 11:389,946101,566,60272,090,00010,463,0002,117,632stderr
3Oct 25, 2026 11:389,96194,223,74171,554,00011,125,0002,117,632stderr
4Oct 25, 2026 11:389,98793,949,84272,415,00010,481,0002,117,632stderr
5Oct 25, 2026 11:3810,00794,164,43971,881,00011,184,0002,117,632stderr
6Oct 25, 2026 11:3810,04494,875,13672,214,00011,153,0002,117,632stderr
7Oct 25, 2026 11:3810,08795,168,97372,628,00011,101,0002,117,632stderr
8Oct 25, 2026 11:3810,09195,255,20172,687,00011,073,0002,117,632stderr
9Oct 25, 2026 11:3810,09794,468,68072,536,00011,272,0002,117,632stderr