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 listJul 2, 2026 07:27Victor MerckléVictor MerckléScore: 7,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 07:297,70871,863,45862,868,0001,111,0002,117,632stderr
2Jul 2, 2026 07:297,72371,826,93162,996,0001,107,0002,117,632stderr
3Jul 2, 2026 07:297,72971,933,39263,062,0001,090,0002,117,632stderr
4Jul 2, 2026 07:297,73472,093,68963,039,0001,157,0002,117,632stderr
5Jul 2, 2026 07:297,73972,040,29063,110,0001,130,0002,117,632stderr
6Jul 2, 2026 07:297,76272,305,29963,397,0001,033,0002,117,632stderr
7Jul 2, 2026 07:297,76872,180,98963,461,0001,021,0002,117,632stderr
8Jul 2, 2026 07:297,79172,348,89463,574,0001,096,0002,117,632stderr
9Jul 2, 2026 07:297,83472,820,75063,904,0001,126,0002,117,632stderr