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 listAug 10, 2025 23:23Leon ZhaoLeon ZhaoScore: 13,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2025 23:2313,024137,722,797106,100,0002,001,0002,285,568
2Aug 10, 2025 23:2313,042133,966,239106,245,0002,004,0002,285,568
3Aug 10, 2025 23:2313,045136,607,526106,272,0002,005,0002,285,568
4Aug 10, 2025 23:2313,047134,609,520106,282,0002,005,0002,465,792
5Aug 10, 2025 23:2313,049133,307,427107,307,0001,002,0002,285,568
6Aug 10, 2025 23:2313,052132,221,927106,328,0002,006,0002,297,856
7Aug 10, 2025 23:2313,052138,772,078107,329,0001,003,0002,461,696
8Aug 10, 2025 23:2313,053136,449,431107,334,0001,003,0002,469,888
9Aug 10, 2025 23:2313,058135,474,036108,378,00002,285,568