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 1, 2026 13:08George SeabridgeGeorge SeabridgeScore: 8,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 13:096,88067,079,23956,029,0001,080,0002,113,536
2Aug 1, 2026 13:096,90767,277,16756,317,0001,017,0002,113,536
3Aug 1, 2026 13:096,90967,318,71456,261,0001,089,0002,113,536
4Aug 1, 2026 13:098,14177,527,99866,479,0001,092,0002,113,536
5Aug 1, 2026 13:098,15377,658,15466,665,0001,006,0002,113,536
6Aug 1, 2026 13:098,16077,789,57366,619,0001,111,0002,113,536
7Aug 1, 2026 13:098,16677,771,88566,682,0001,096,0002,113,536
8Aug 1, 2026 13:098,18979,306,08666,831,0001,138,0002,113,536
9Aug 1, 2026 13:098,31378,920,88567,976,0001,026,0002,113,536