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 12, 2025 02:01Ashish AhujaAshish AhujaScore: 48,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 02:0148,101424,282,537397,237,0002,001,0002,285,568
2Aug 12, 2025 02:0148,130425,766,938397,479,0001,997,0002,285,568
3Aug 12, 2025 02:0148,136429,849,493397,532,0001,997,0002,351,104
4Aug 12, 2025 02:0148,156426,038,631397,693,0001,998,0002,285,568
5Aug 12, 2025 02:0148,181422,192,516397,902,0001,999,0002,510,848
6Aug 12, 2025 02:0148,352425,893,724401,324,00002,510,848
7Aug 12, 2025 02:0148,685428,540,360402,084,0002,000,0002,506,752
8Aug 12, 2025 02:0148,692427,217,787402,147,0002,000,0002,510,848
9Aug 12, 2025 02:0148,706434,453,391402,258,0002,001,0002,510,848