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:09Dominique GarmierDominique GarmierScore: 11,756Success
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:0911,549123,874,77592,864,0002,995,0002,408,448
2Mar 13, 2026 15:0911,647125,480,92395,677,000996,0002,285,568
3Mar 13, 2026 15:0911,746122,425,86196,490,0001,005,0002,514,944
4Mar 13, 2026 15:0911,750123,982,99696,516,0001,005,0002,289,664
5Mar 13, 2026 15:0911,756126,284,04997,576,00002,420,736
6Mar 13, 2026 15:0911,827124,192,02296,162,0002,003,0002,400,256
7Mar 13, 2026 15:0911,922130,148,48596,953,0001,999,0002,412,544
8Mar 13, 2026 15:0911,965122,624,40496,297,0003,009,0002,416,640
9Mar 13, 2026 15:0912,501129,875,954101,767,0001,995,0002,412,544