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:06Ashish AhujaAshish AhujaScore: 11,872Success
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:0611,474115,093,92488,216,0007,017,0002,347,008
2Aug 18, 2025 06:0611,680122,919,07090,944,0005,996,0002,519,040
3Aug 18, 2025 06:0611,760135,455,11789,644,0007,968,0002,342,912
4Aug 18, 2025 06:0611,872126,973,07890,573,0007,962,0002,465,792
5Aug 18, 2025 06:0611,901124,910,22888,799,0009,977,0002,523,136
6Aug 18, 2025 06:0612,803129,254,03099,250,0007,017,0002,342,912