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 listSep 5, 2026 13:14wnwnScore: 3,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:163,27435,677,01126,175,0001,007,0002,113,536
2Sep 5, 2026 13:163,27935,672,25226,128,0001,090,0002,113,536
3Sep 5, 2026 13:163,28635,752,70426,274,0001,005,0002,113,536
4Sep 5, 2026 13:163,29135,563,46626,289,0001,031,0002,113,536
5Sep 5, 2026 13:163,31435,925,03926,471,0001,036,0002,113,536
6Sep 5, 2026 13:163,32035,992,43826,526,0001,034,0002,113,536
7Sep 5, 2026 13:163,32936,123,99026,547,0001,090,0002,113,536
8Sep 5, 2026 13:163,34536,165,59526,654,0001,110,0002,113,536
9Sep 5, 2026 13:163,39036,623,94827,136,0001,009,0002,113,536