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 listDec 27, 2025 18:16Josu San MartinJosu San MartinScore: 32,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 18:1632,298291,161,772266,071,0002,000,0002,281,472
2Dec 27, 2025 18:1632,314290,786,002266,209,0002,001,0002,367,488
3Dec 27, 2025 18:1632,329297,559,185267,330,0001,001,0002,289,664
4Dec 27, 2025 18:1632,337298,724,697268,401,00002,359,296
5Dec 27, 2025 18:1632,344293,521,472267,454,0001,001,0002,502,656
6Dec 27, 2025 18:1632,350292,608,323267,508,0001,001,0002,289,664
7Dec 27, 2025 18:1632,370294,588,588267,674,000998,0002,359,296
8Dec 27, 2025 18:1632,374298,636,999266,710,0001,997,0002,359,296
9Dec 27, 2025 18:1632,387305,688,439267,811,000999,0002,289,664