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 listApr 24, 2026 06:57olliecrowolliecrowScore: 14,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 07:0014,192126,033,733115,804,0001,996,0002,523,136
2Apr 24, 2026 07:0014,209126,200,559114,943,0002,998,0002,416,640
3Apr 24, 2026 07:0014,246126,477,377116,243,0002,004,0002,510,848
4Apr 24, 2026 07:0014,279126,814,517116,511,0002,008,0002,392,064
5Apr 24, 2026 07:0014,284126,816,066115,550,0003,014,0002,506,752
6Apr 24, 2026 07:0014,315127,031,098116,821,0001,996,0002,572,288
7Apr 24, 2026 07:0014,318126,085,366113,850,0004,993,0002,330,624
8Apr 24, 2026 07:0014,533127,893,802117,610,0003,015,0002,400,256
9Apr 24, 2026 07:0014,762130,555,669121,528,0001,004,0002,420,736