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 16, 2025 13:40Ashish AhujaAshish AhujaScore: 20,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 13:4120,622198,837,584169,162,0002,001,0002,285,568
2Aug 16, 2025 13:4120,624196,145,793168,180,0003,003,0002,506,752
3Aug 16, 2025 13:4020,640193,438,649169,307,0002,003,0002,277,376
4Aug 16, 2025 13:4020,670202,742,725169,553,0002,006,0002,285,568
5Aug 16, 2025 13:4120,748197,484,079169,202,0003,003,0002,285,568
6Aug 16, 2025 13:4021,635205,260,798177,574,0001,995,0002,285,568