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 listOct 5, 2026 02:49FrederickFrederickScore: 8,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:498,77883,590,17471,811,0001,050,0002,117,632
2Oct 5, 2026 02:498,79384,204,95771,936,0001,046,0002,117,632
3Oct 5, 2026 02:498,79884,208,11071,992,0001,039,0002,117,632
4Oct 5, 2026 02:498,94185,361,33573,177,0001,037,0002,117,632
5Oct 5, 2026 02:498,94885,439,92073,217,0001,058,0002,117,632
6Oct 5, 2026 02:498,99585,199,21273,632,0001,031,0002,117,632
7Oct 5, 2026 02:499,03886,300,05873,978,0001,040,0002,117,632
8Oct 5, 2026 02:499,14188,086,38674,830,0001,043,0002,117,632
9Oct 5, 2026 02:499,45789,422,55076,479,0002,019,0002,117,632