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 27, 2026 23:42A_ShamanA_ShamanScore: 38,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 23:4238,867332,036,738321,595,0001,004,0002,113,536
2Jun 27, 2026 23:4238,902332,140,458321,890,0001,003,0002,113,536
3Jun 27, 2026 23:4238,946333,095,798322,256,0001,004,0002,113,536
4Jun 27, 2026 23:4238,965332,709,031322,406,0001,006,0002,113,536
5Jun 27, 2026 23:4238,993332,966,064322,633,0001,013,0002,113,536
6Jun 27, 2026 23:4238,999332,949,235322,693,0001,005,0002,113,536
7Jun 27, 2026 23:4239,007333,031,901322,756,0001,003,0002,113,536
8Jun 27, 2026 23:4239,012334,449,603322,799,0001,004,0002,113,536
9Jun 27, 2026 23:4239,014333,117,222322,820,0001,003,0002,113,536