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: 9,578Success
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:509,47289,826,42277,599,0001,023,0002,117,632
2Oct 5, 2026 02:509,49489,343,64176,778,0002,023,0002,117,632
3Oct 5, 2026 02:509,49990,086,38976,797,0002,045,0002,117,632
4Oct 5, 2026 02:509,50090,046,12976,803,0002,050,0002,117,632
5Oct 5, 2026 02:509,57890,728,54277,457,0002,045,0002,117,632
6Oct 5, 2026 02:509,64290,464,10879,013,0001,021,0002,117,632
7Oct 5, 2026 02:509,69091,568,92279,410,0001,021,0002,117,632
8Oct 5, 2026 02:509,71291,701,09278,577,0002,039,0002,117,632
9Oct 5, 2026 02:509,83692,808,12679,608,0002,037,0002,117,632