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 26, 2025 13:12dhayadhayaScore: 273,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2025 13:12273,1852,294,654,6672,163,506,000103,928,0002,433,024
2Oct 26, 2025 13:12273,1982,294,820,1562,180,600,00086,944,0002,433,024
3Oct 26, 2025 13:12273,2602,290,557,7662,172,102,00095,960,0002,428,928
4Oct 26, 2025 13:12273,3832,299,686,7812,164,123,000104,957,0002,326,528
5Oct 26, 2025 13:12273,3982,304,185,1662,155,246,000113,960,0002,428,928
6Oct 26, 2025 13:12273,5852,300,223,4322,169,810,000100,944,0002,326,528
7Oct 26, 2025 13:12273,6462,296,713,8202,166,294,000104,965,0002,326,528
8Oct 26, 2025 13:12273,6912,301,012,4582,171,697,00099,940,0002,424,832
9Oct 26, 2025 13:12273,9712,304,414,6822,191,995,00081,962,0002,326,528