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 listAug 27, 2026 04:04Victor MerckléVictor MerckléScore: 3,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 04:053,68238,872,89529,455,0001,113,0002,113,536
2Aug 27, 2026 04:053,69338,913,49329,516,0001,136,0002,113,536
3Aug 27, 2026 04:053,69339,745,53529,495,0001,160,0002,113,536
4Aug 27, 2026 04:053,71039,126,45029,710,0001,085,0002,113,536
5Aug 27, 2026 04:053,72039,188,77129,782,0001,099,0002,113,536
6Aug 27, 2026 04:053,72139,242,00629,770,0001,116,0002,113,536
7Aug 27, 2026 04:053,74139,352,63229,967,0001,088,0002,113,536
8Aug 27, 2026 04:053,85040,132,99630,907,0001,053,0002,113,536
9Aug 27, 2026 04:053,98142,117,90131,981,0001,062,0002,113,536