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 listMay 25, 2026 16:07Kenzie_RTKenzie_RTScore: 53,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:0753,809456,837,188445,363,0001,259,0002,113,536
2May 25, 2026 16:0753,810456,079,207445,388,0001,241,0002,113,536
3May 25, 2026 16:0753,847456,315,452445,714,0001,221,0002,113,536
4May 25, 2026 16:0753,865458,941,929446,083,0001,004,0002,113,536
5May 25, 2026 16:0753,869459,253,343445,874,0001,246,0002,113,536
6May 25, 2026 16:0753,877457,076,738445,924,0001,260,0002,113,536
7May 25, 2026 16:0753,916456,878,237446,345,0001,159,0002,113,536
8May 25, 2026 16:0753,934459,362,109446,653,0001,006,0002,113,536
9May 25, 2026 16:0753,946457,283,469446,753,0001,003,0002,113,536