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 18, 2025 16:20Andy BlairAndy BlairScore: 187,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2025 16:20186,8721,580,669,9731,465,088,00085,946,0002,318,336
2Jun 18, 2025 16:20186,9131,574,765,5801,455,421,00095,961,0002,322,432
3Jun 18, 2025 16:20186,9511,574,892,2371,443,717,000107,978,0002,322,432
4Jun 18, 2025 16:20187,0541,574,785,5511,465,572,00086,974,0002,322,432
5Jun 18, 2025 16:20187,1301,580,125,5391,448,236,000104,944,0002,322,432
6Jun 18, 2025 16:20187,1331,576,629,6031,455,254,00097,949,0002,478,080
7Jun 18, 2025 16:20187,2421,580,733,6451,462,165,00091,947,0002,322,432
8Jun 18, 2025 16:20187,2611,576,596,6831,455,314,00098,953,0002,478,080
9Jun 18, 2025 16:20187,4601,585,276,7311,447,990,000107,924,0002,318,336