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 11, 2025 03:30Marco BarboneMarco BarboneScore: 33,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 03:3033,469300,808,039275,793,0001,998,0002,265,088
2Oct 11, 2025 03:3033,472304,421,681276,819,000999,0002,273,280
3Oct 11, 2025 03:3033,479300,947,551275,879,0001,999,0002,289,664
4Oct 11, 2025 03:3033,480299,770,768275,887,0001,999,0002,269,184
5Oct 11, 2025 03:3033,482301,707,783276,904,000999,0002,265,088
6Oct 11, 2025 03:3033,493305,991,378275,994,0001,999,0002,281,472
7Oct 11, 2025 03:3033,499304,010,883277,043,0001,000,0002,289,664
8Oct 11, 2025 03:3033,500302,262,282277,051,0001,000,0002,392,064
9Oct 11, 2025 03:3033,507300,852,008276,104,0002,000,0002,523,136