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 28, 2026 08:49A_ShamanA_ShamanScore: 40,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 08:4940,064341,851,823331,487,0001,052,0002,113,536
2Jun 28, 2026 08:4940,067341,811,428331,497,0001,062,0002,113,536
3Jun 28, 2026 08:4940,069341,919,996331,448,0001,129,0002,113,536
4Jun 28, 2026 08:4940,074341,877,323331,460,0001,156,0002,113,536
5Jun 28, 2026 08:4940,078341,974,172331,445,0001,209,0002,113,536
6Jun 28, 2026 08:4940,080341,933,888331,511,0001,157,0002,113,536
7Jun 28, 2026 08:4940,083342,013,392331,534,0001,160,0002,113,536
8Jun 28, 2026 08:4940,093342,093,796331,564,0001,209,0002,113,536
9Jun 28, 2026 08:4940,095342,182,926331,526,0001,267,0002,113,536