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 listSep 16, 2025 17:44sheryllynn24sheryllynn24Score: 33,467Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2025 17:4432,440294,906,495267,255,0002,001,0002,371,584
2Sep 16, 2025 17:4432,460294,292,014267,416,0002,003,0002,277,376
3Sep 16, 2025 17:4433,462304,101,492275,737,0001,998,0002,289,664
4Sep 16, 2025 17:4433,464304,049,841276,752,000999,0002,277,376
5Sep 16, 2025 17:4433,467303,919,443275,782,0001,998,0002,273,280
6Sep 16, 2025 17:4433,481303,673,412273,892,0003,998,0002,277,376
7Sep 16, 2025 17:4433,484304,679,630274,921,0002,999,0002,277,376
8Sep 16, 2025 17:4433,493302,544,091274,994,0002,999,0002,351,104
9Sep 16, 2025 17:4433,500300,422,418275,054,0003,000,0002,277,376