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 28, 2026 15:29Victor MerckléVictor MerckléScore: 6,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 15:326,22160,692,44650,619,0001,016,0002,113,536
2Aug 28, 2026 15:326,30060,627,34351,276,0001,018,0002,113,536
3Aug 28, 2026 15:326,34860,999,59551,676,0001,016,0002,113,536
4Aug 28, 2026 15:326,35261,013,82651,711,0001,015,0002,113,536
5Aug 28, 2026 15:326,40261,438,30652,126,0001,016,0002,113,536
6Aug 28, 2026 15:326,43661,713,00452,392,0001,034,0002,113,536
7Aug 28, 2026 15:326,44261,789,08652,453,0001,016,0002,113,536
8Aug 28, 2026 15:326,60264,464,96652,781,0002,017,0002,113,536
9Aug 28, 2026 15:326,68863,839,67754,501,0001,016,0002,113,536