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 31, 2026 10:27George SeabridgeGeorge SeabridgeScore: 80,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 10:2779,396669,122,188434,392,000224,600,0002,117,632
2Jul 31, 2026 10:2779,542670,202,913437,625,000222,577,0002,117,632
3Jul 31, 2026 10:2779,858672,911,228439,192,000223,637,0002,117,632
4Jul 31, 2026 10:2779,919674,065,772433,785,000229,549,0002,117,632
5Jul 31, 2026 10:2780,154675,255,183433,546,000231,735,0002,117,632
6Jul 31, 2026 10:2780,207675,815,692436,356,000229,368,0002,117,632
7Jul 31, 2026 10:2780,228675,920,930433,450,000232,446,0002,117,632
8Jul 31, 2026 10:2780,237675,978,105433,614,000232,358,0002,117,632
9Jul 31, 2026 10:2780,695679,951,240435,089,000234,682,0002,117,632