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 29, 2026 15:30Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 54,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 15:3054,180471,226,122447,699,0001,998,0002,281,472
2Mar 29, 2026 15:3054,180472,495,954447,697,0001,998,0002,281,472
3Mar 29, 2026 15:3054,189474,193,215448,768,000999,0002,281,472
4Mar 29, 2026 15:3054,192471,286,690447,794,0001,999,0002,281,472
5Mar 29, 2026 15:3054,194472,741,637448,808,000999,0002,400,256
6Mar 29, 2026 15:3054,196472,639,064448,824,000999,0002,281,472
7Mar 29, 2026 15:3055,442482,929,988459,165,0001,000,0002,281,472
8Mar 29, 2026 15:3055,448489,508,102460,218,00002,404,352
9Mar 29, 2026 15:3055,468490,229,537460,382,00002,281,472