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 13:34Victor MerckléVictor MerckléScore: 3,711Success
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 13:353,68039,538,40929,387,0001,157,0002,113,536
2Aug 27, 2026 13:353,69039,711,83429,454,0001,174,0002,113,536
3Aug 27, 2026 13:353,69339,702,51029,492,0001,160,0002,113,536
4Aug 27, 2026 13:353,69638,947,98329,541,0001,141,0002,113,536
5Aug 27, 2026 13:353,71139,870,90829,667,0001,138,0002,113,536
6Aug 27, 2026 13:353,71139,150,88629,654,0001,148,0002,113,536
7Aug 27, 2026 13:353,72639,926,84829,793,0001,136,0002,113,536
8Aug 27, 2026 13:353,75141,832,67730,003,0001,134,0002,113,536
9Aug 27, 2026 13:353,81347,326,22630,481,0001,168,0002,113,536