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 15, 2026 01:41Kevin HeaveyKevin HeaveyScore: 3,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 01:423,82841,445,40330,513,0001,265,0002,117,632
2Jul 15, 2026 01:423,83741,463,86530,573,0001,276,0002,117,632
3Jul 15, 2026 01:423,84241,436,20630,615,0001,278,0002,117,632
4Jul 15, 2026 01:423,85341,592,53930,692,0001,288,0002,117,632
5Jul 15, 2026 01:423,86741,729,89030,829,0001,272,0002,117,632
6Jul 15, 2026 01:423,88341,894,51931,192,0001,044,0002,117,632
7Jul 15, 2026 01:423,88541,851,55430,949,0001,299,0002,117,632
8Jul 15, 2026 01:423,89041,899,91231,244,0001,048,0002,117,632
9Jul 15, 2026 01:423,89941,976,76431,073,0001,290,0002,117,632