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 listJul 27, 2025 04:24Serendipity1902Serendipity1902Score: 51,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 04:2451,283452,309,220424,649,000999,0002,453,504
2Jul 27, 2025 04:2451,291454,741,197423,720,0001,998,0002,523,136
3Jul 27, 2025 04:2451,297454,154,818421,767,0003,997,0002,449,408
4Jul 27, 2025 04:2451,299452,132,538422,785,0002,998,0002,449,408
5Jul 27, 2025 04:2451,299458,850,600424,783,000999,0002,445,312
6Jul 27, 2025 04:2451,302449,669,190423,810,0001,999,0002,265,088
7Jul 27, 2025 04:2451,303449,480,402423,812,0001,999,0002,523,136
8Jul 27, 2025 04:2451,304451,703,805423,823,0001,999,0002,527,232
9Jul 27, 2025 04:2451,306447,101,455424,839,000999,0002,523,136