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 18, 2026 12:38Kevin HeaveyKevin HeaveyScore: 3,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 13:043,61339,738,66728,774,0001,218,0002,117,632
2Jul 18, 2026 13:043,61939,833,98128,816,0001,223,0002,117,632
3Jul 18, 2026 13:043,62239,756,06928,827,0001,241,0002,117,632
4Jul 18, 2026 13:043,63039,970,68429,086,0001,043,0002,117,632
5Jul 18, 2026 13:043,64339,922,30029,023,0001,219,0002,117,632
6Jul 18, 2026 13:043,64639,977,56729,022,0001,241,0002,117,632
7Jul 18, 2026 13:043,64640,007,90629,228,0001,042,0002,117,632
8Jul 18, 2026 13:043,71440,567,88429,615,0001,213,0002,117,632
9Jul 18, 2026 13:043,88141,999,08031,167,0001,046,0002,117,632