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 16:54Victor MerckléVictor MerckléScore: 3,801Success
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 16:553,78039,760,76530,112,0001,262,0002,113,536
2Aug 27, 2026 16:553,78739,793,86430,238,0001,196,0002,113,536
3Aug 27, 2026 16:553,79339,812,19730,203,0001,284,0002,113,536
4Aug 27, 2026 16:553,79439,857,83230,227,0001,269,0002,113,536
5Aug 27, 2026 16:553,80139,874,92030,273,0001,276,0002,113,536
6Aug 27, 2026 16:553,80640,574,67630,286,0001,308,0002,113,536
7Aug 27, 2026 16:553,83940,308,57530,591,0001,274,0002,113,536
8Aug 27, 2026 16:553,84440,573,51830,625,0001,288,0002,113,536
9Aug 27, 2026 16:554,04841,959,01432,385,0001,217,0002,113,536