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 listJan 28, 2025 10:25SaaskaSaaskaScore: 57,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 10:2557,071503,664,131472,690,000999,0002,449,408
2Jan 28, 2025 10:2557,073498,976,307471,711,0001,998,0002,523,136
3Jan 28, 2025 10:2557,076504,587,939472,728,000999,0002,445,312
4Jan 28, 2025 10:2557,080496,822,096470,770,0002,998,0002,449,408
5Jan 28, 2025 10:2557,228502,100,350473,993,000999,0002,527,232
6Jan 28, 2025 10:2557,422501,600,701475,605,000999,0002,527,232
7Jan 28, 2025 10:2557,427507,119,683474,645,0001,998,0002,449,408
8Jan 28, 2025 10:2557,430501,107,659475,673,000999,0002,449,408
9Jan 28, 2025 10:2557,438501,057,479475,733,000999,0002,449,408