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 20, 2025 07:30sheryllynn24sheryllynn24Score: 13,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 07:3013,027131,756,327107,122,0001,001,0002,285,568
2Sep 20, 2025 07:3013,045135,222,484106,271,0002,005,0002,510,848
3Sep 20, 2025 07:3013,060136,254,866105,384,0003,010,0002,523,136
4Sep 20, 2025 07:3013,093136,817,093106,675,0001,993,0002,285,568
5Sep 20, 2025 07:3013,102134,399,430106,753,0001,995,0002,367,488
6Sep 20, 2025 07:3013,108136,378,074107,801,000998,0002,363,392
7Sep 20, 2025 07:3013,110140,587,246107,811,000998,0002,506,752
8Sep 20, 2025 07:3013,122132,379,467106,917,0001,998,0002,523,136
9Sep 20, 2025 07:3013,176135,121,115108,361,0001,003,0002,285,568