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 2, 2026 11:57George SeabridgeGeorge SeabridgeScore: 7,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:587,79374,580,94963,595,0001,090,0002,113,536
2Aug 2, 2026 11:587,79474,569,42463,611,0001,084,0002,113,536
3Aug 2, 2026 11:587,83074,956,10163,909,0001,085,0002,113,536
4Aug 2, 2026 11:587,83874,991,26463,959,0001,099,0002,113,536
5Aug 2, 2026 11:587,88175,292,26464,325,0001,091,0002,113,536
6Aug 2, 2026 11:587,88875,388,50264,378,0001,098,0002,113,536
7Aug 2, 2026 11:587,96785,365,60364,955,0001,174,0002,113,536
8Aug 2, 2026 11:588,07187,792,59265,732,0001,263,0002,113,536
9Aug 2, 2026 11:588,08187,051,81765,906,0001,168,0002,113,536