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 18, 2026 12:15boop34boop34Score: 8,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 12:168,95584,011,55473,326,0001,007,0002,113,536
2Jul 18, 2026 12:168,96984,116,07873,443,0001,007,0002,113,536
3Jul 18, 2026 12:168,97084,057,29473,446,0001,007,0002,113,536
4Jul 18, 2026 12:168,97384,091,18173,477,0001,006,0002,113,536
5Jul 18, 2026 12:168,97484,215,54773,478,0001,014,0002,113,536
6Jul 18, 2026 12:168,98884,298,69673,591,0001,010,0002,113,536
7Jul 18, 2026 12:168,99484,321,06573,625,0001,030,0002,113,536
8Jul 18, 2026 12:169,08385,189,18474,355,0001,036,0002,113,536
9Jul 18, 2026 12:169,09685,107,98174,463,0001,035,0002,113,536