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 listJun 21, 2025 22:14Valentin KofmanValentin KofmanScore: 50,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 22:1450,353449,473,179416,927,000999,0002,277,376
2Jun 21, 2025 22:1450,355444,909,592415,948,0001,999,0002,269,184
3Jun 21, 2025 22:1450,360445,603,940415,987,0001,999,0002,289,664
4Jun 21, 2025 22:1450,381444,728,884416,161,0002,000,0002,289,664
5Jun 21, 2025 22:1450,387441,383,070417,208,0001,000,0002,289,664
6Jun 21, 2025 22:1450,403436,418,619417,345,0001,000,0002,383,872
7Jun 21, 2025 22:1450,433442,685,660416,593,0001,998,0002,273,280
8Jun 21, 2025 22:1450,492442,435,238417,080,0002,000,0002,269,184
9Jun 21, 2025 22:1450,512442,168,873419,253,00002,281,472