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 listAug 10, 2025 22:31Leon ZhaoLeon ZhaoScore: 13,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2025 22:3113,722138,354,597112,895,000999,0002,478,080
2Aug 10, 2025 22:3113,725139,892,989111,921,0001,998,0002,285,568
3Aug 10, 2025 22:3113,727145,212,709112,935,000999,0002,285,568
4Aug 10, 2025 22:3113,728143,894,969111,942,0001,998,0002,478,080
5Aug 10, 2025 22:3113,729138,377,451112,949,000999,0002,285,568
6Aug 10, 2025 22:3113,729150,873,065112,953,000999,0002,285,568
7Aug 10, 2025 22:3113,733141,565,306111,988,0001,999,0002,469,888
8Aug 10, 2025 22:3113,735140,929,205112,001,0002,000,0002,285,568
9Aug 10, 2025 22:3113,737140,172,592113,015,0001,000,0002,285,568