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 listFeb 12, 2025 01:26Miguel Rodrigues Carrilho BorgesMiguel Rodrigues Carrilho BorgesScore: 77,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2025 01:2677,334664,820,956639,873,0001,999,0002,273,280
2Feb 12, 2025 01:2677,378666,970,682641,239,0001,000,0002,289,664
3Feb 12, 2025 01:2677,379668,372,550642,247,00002,289,664
4Feb 12, 2025 01:2677,379668,961,943641,248,0001,000,0002,277,376
5Feb 12, 2025 01:2677,393668,348,960641,360,0001,000,0002,293,760
6Feb 12, 2025 01:2677,397667,784,555642,394,00002,289,664
7Feb 12, 2025 01:2677,401675,191,041641,427,000999,0002,273,280
8Feb 12, 2025 01:2677,410671,486,121641,508,000999,0002,269,184
9Feb 12, 2025 01:2677,416672,179,197640,556,0001,998,0002,289,664