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 5, 2026 21:30Kevin HeaveyKevin HeaveyScore: 5,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:315,04251,415,82840,591,0001,263,0002,117,632
2Jul 5, 2026 21:315,18052,553,82441,725,0001,273,0002,117,632
3Jul 5, 2026 21:315,21652,838,28942,126,0001,167,0002,117,632
4Jul 5, 2026 21:315,25153,253,69042,303,0001,285,0002,117,632
5Jul 5, 2026 21:315,26253,233,61442,410,0001,270,0002,117,632
6Jul 5, 2026 21:315,27354,688,41442,498,0001,275,0002,117,632
7Jul 5, 2026 21:315,28353,370,04542,592,0001,259,0002,117,632
8Jul 5, 2026 21:315,36354,047,70443,272,0001,249,0002,117,632
9Jul 5, 2026 21:315,37954,185,25443,397,0001,251,0002,117,632