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 29, 2025 05:08Josu San MartinJosu San MartinScore: 30,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 05:0830,917283,143,140255,611,0001,002,0002,285,568
2Dec 29, 2025 05:0830,933282,724,977255,749,000999,0002,277,376
3Dec 29, 2025 05:0830,963284,620,832254,997,0001,999,0002,359,296
4Dec 29, 2025 05:0830,967281,068,715255,022,0002,000,0002,363,392
5Dec 29, 2025 05:0830,969287,026,169255,044,0002,000,0002,277,376
6Dec 29, 2025 05:0830,977284,904,734254,110,0003,001,0002,277,376
7Dec 29, 2025 05:0830,992282,760,298255,232,0002,001,0002,367,488
8Dec 29, 2025 05:0831,005277,645,591257,344,00002,367,488
9Dec 29, 2025 05:0831,030281,610,556255,549,0001,996,0002,277,376