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 listDec 27, 2025 20:03StingStingScore: 516,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 20:03516,2304,309,480,9964,211,745,00072,960,0002,375,680
2Dec 27, 2025 20:03516,2514,312,984,1244,206,922,00077,961,0002,273,280
3Dec 27, 2025 20:03516,2814,309,918,2184,225,157,00059,973,0002,273,280
4Dec 27, 2025 20:03516,6944,312,527,8364,203,607,00084,951,0002,273,280
5Dec 27, 2025 20:03516,9354,322,092,0074,209,604,00080,953,0002,273,280
6Dec 27, 2025 20:03517,5234,328,404,7354,220,487,00074,955,0002,273,280
7Dec 27, 2025 20:03518,2284,331,017,7674,218,328,00082,967,0002,273,280
8Dec 27, 2025 20:03518,4474,325,643,9624,223,142,00079,964,0002,379,776
9Dec 27, 2025 20:03528,9384,419,758,0624,322,212,00067,971,0002,273,280