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 30, 2026 21:43Josu San MartinJosu San MartinScore: 4,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:434,21544,609,73833,951,0001,034,0002,113,536
2Aug 30, 2026 21:434,23243,651,37734,041,0001,087,0002,113,536
3Aug 30, 2026 21:434,23643,646,38034,035,0001,129,0002,113,536
4Aug 30, 2026 21:434,25443,869,47134,197,0001,112,0002,113,536
5Aug 30, 2026 21:434,26343,875,73434,346,0001,041,0002,113,536
6Aug 30, 2026 21:434,27543,925,65934,361,0001,127,0002,113,536
7Aug 30, 2026 21:434,27543,896,69134,375,0001,115,0002,113,536
8Aug 30, 2026 21:434,27643,976,78534,379,0001,120,0002,113,536
9Aug 30, 2026 21:434,27843,947,13634,402,0001,111,0002,113,536