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 17, 2026 23:29A_ShamanA_ShamanScore: 64,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 23:2964,164541,679,239473,664,00058,899,0002,113,536
2Jun 17, 2026 23:2964,198541,965,857473,621,00059,225,0002,113,536
3Jun 17, 2026 23:2964,213542,091,550473,709,00059,264,0002,113,536
4Jun 17, 2026 23:2964,222542,082,689473,534,00059,516,0002,113,536
5Jun 17, 2026 23:2964,229542,338,321473,689,00059,419,0002,113,536
6Jun 17, 2026 23:2964,246542,265,885473,368,00059,874,0002,113,536
7Jun 17, 2026 23:2964,259542,777,692473,601,00059,751,0002,113,536
8Jun 17, 2026 23:2964,309542,760,364473,574,00060,192,0002,113,536
9Jun 17, 2026 23:2964,316542,957,182473,730,00060,096,0002,113,536