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 17:51George SeabridgeGeorge SeabridgeScore: 6,747Success
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 17:516,65265,855,73053,028,0002,184,0002,113,536
2Aug 2, 2026 17:516,69966,335,77153,353,0002,254,0002,113,536
3Aug 2, 2026 17:516,73366,573,02853,572,0002,313,0002,113,536
4Aug 2, 2026 17:516,73666,619,52153,646,0002,264,0002,113,536
5Aug 2, 2026 17:516,74766,739,46053,745,0002,262,0002,113,536
6Aug 2, 2026 17:516,84367,441,78654,526,0002,275,0002,113,536
7Aug 2, 2026 17:517,26671,015,07358,065,0002,247,0002,113,536
8Aug 2, 2026 17:517,41372,140,75359,318,0002,211,0002,113,536
9Aug 2, 2026 17:517,46573,252,31359,719,0002,241,0002,113,536