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 19, 2025 12:11limanjun99limanjun99Score: 30,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2025 12:1129,698269,159,447245,494,0001,002,0002,265,088
2Sep 19, 2025 12:1129,724272,634,619244,716,0001,997,0002,273,280
3Sep 19, 2025 12:1130,042271,305,097247,346,0002,002,0002,519,040
4Sep 19, 2025 12:1130,049270,206,801248,408,0001,001,0002,265,088
5Sep 19, 2025 12:1130,051272,570,167248,420,0001,001,0002,273,280
6Sep 19, 2025 12:1130,056271,859,153249,464,00002,269,184
7Sep 19, 2025 12:1130,058271,463,397248,478,0001,001,0002,510,848
8Sep 19, 2025 12:1130,058273,551,965248,480,0001,001,0002,273,280
9Sep 19, 2025 12:1130,063278,374,263248,523,0001,002,0002,273,280