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 15, 2026 15:50timothygktimothygkScore: 43,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 15:5042,637364,732,605352,862,0001,026,0002,117,632stderr
2Oct 15, 2026 15:5042,884366,609,658354,762,0001,177,0002,117,632stderr
3Oct 15, 2026 15:5043,064368,219,753356,433,0001,004,0002,117,632stderr
4Oct 15, 2026 15:5043,090368,937,540356,505,0001,144,0002,117,632stderr
5Oct 15, 2026 15:5043,156368,824,160357,110,0001,090,0002,117,632stderr
6Oct 15, 2026 15:5043,184368,984,950357,347,0001,085,0002,117,632stderr
7Oct 15, 2026 15:5043,328370,870,758358,568,0001,055,0002,117,632stderr
8Oct 15, 2026 15:5043,395371,385,056359,168,0001,012,0002,117,632stderr
9Oct 15, 2026 15:5043,896375,561,305363,335,0001,002,0002,117,632stderr