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 18, 2025 06:08Ashish AhujaAshish AhujaScore: 11,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 06:0811,525121,909,78188,683,0006,975,0002,351,104
2Aug 18, 2025 06:0811,685122,808,72187,987,0008,998,0002,342,912
3Aug 18, 2025 06:0811,710121,292,24089,174,0008,015,0002,523,136
4Aug 18, 2025 06:0811,946120,952,28389,134,00010,015,0002,322,432
5Aug 18, 2025 06:0811,970124,724,96692,330,0007,025,0002,523,136
6Aug 18, 2025 06:0812,009124,597,28088,711,00010,964,0002,293,760