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 listApr 13, 2025 17:09ssssobekssssobekScore: 163,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2025 17:09162,6561,383,667,0651,279,095,00070,949,0002,293,760
2Apr 13, 2025 17:09162,6621,373,499,7431,278,144,00071,951,0002,293,760
3Apr 13, 2025 17:09162,7161,378,858,0901,271,573,00078,973,0002,498,560
4Apr 13, 2025 17:09162,8121,374,879,6101,294,368,00056,972,0002,293,760
5Apr 13, 2025 17:09163,0521,381,454,5771,280,369,00072,964,0002,281,472
6Apr 13, 2025 17:09166,4121,411,159,3751,317,255,00063,963,0002,494,464
7Apr 13, 2025 17:09170,9321,445,602,0031,350,746,00067,987,0002,506,752
8Apr 13, 2025 17:09172,5081,461,357,6021,353,830,00077,990,0002,293,760
9Apr 13, 2025 17:09174,3741,474,548,7131,375,336,00071,965,0002,293,760