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 10, 2025 21:47Hayk KarapetyanHayk KarapetyanScore: 51,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2025 20:1051,909452,859,313428,846,0001,999,0002,265,088
2Jun 10, 2025 20:1051,929454,267,291429,012,0002,000,0002,277,376
3Jun 10, 2025 20:1051,937456,687,232429,079,0002,000,0002,265,088
4Jun 10, 2025 20:1051,938458,516,871429,086,0002,000,0002,285,568
5Jun 10, 2025 20:1051,942457,180,028431,117,00002,260,992
6Jun 10, 2025 21:4751,944449,425,627429,137,0002,000,0002,523,136
7Jun 10, 2025 20:1051,945456,706,125429,141,0002,000,0002,367,488
8Jun 10, 2025 20:1051,948467,420,239430,167,0001,000,0002,523,136
9Jun 10, 2025 21:4751,948452,886,464430,171,0001,000,0002,285,568
10Jun 10, 2025 21:4751,952458,466,993430,204,0001,000,0002,265,088
11Jun 10, 2025 20:1051,964460,200,034431,303,00002,265,088
12Jun 10, 2025 20:1051,980461,163,895430,435,0001,001,0002,265,088