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 listJun 23, 2025 00:12Valentin KofmanValentin KofmanScore: 30,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 00:1230,584281,349,596251,851,0001,998,0002,289,664
2Jun 23, 2025 00:1230,589275,551,569251,892,0001,999,0002,289,664
3Jun 23, 2025 00:1230,611286,496,040252,075,0002,000,0002,273,280