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 listMar 13, 2026 15:04Dominique GarmierDominique GarmierScore: 11,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:0411,748125,738,45096,502,0001,005,0002,289,664
2Mar 13, 2026 15:0411,780128,488,18995,780,0001,995,0002,404,352
3Mar 13, 2026 15:0411,823122,204,22496,130,0002,002,0002,289,664
4Mar 13, 2026 15:0411,831131,545,65296,195,0002,004,0002,408,448
5Mar 13, 2026 15:0411,879131,487,66097,587,0001,006,0002,289,664
6Mar 13, 2026 15:0411,893131,297,62996,720,0001,994,0002,289,664
7Mar 13, 2026 15:0412,025127,969,80998,808,000998,0002,289,664
8Mar 13, 2026 15:0412,028126,498,66797,840,0001,996,0002,404,352
9Mar 13, 2026 15:0412,060122,448,99898,094,0002,001,0002,412,544