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 listMay 11, 2026 19:43TudyMTudyMScore: 35,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 19:4335,544303,765,802294,013,0001,004,0002,113,536
2May 11, 2026 19:4335,620307,137,695294,649,0001,004,0002,113,536
3May 11, 2026 19:4335,624304,604,704294,677,0001,004,0002,113,536
4May 11, 2026 19:4335,631304,876,116294,736,0001,005,0002,113,536
5May 11, 2026 19:4335,644306,817,496294,843,0001,003,0002,113,536
6May 11, 2026 19:4335,657304,875,179294,957,0001,003,0002,113,536
7May 11, 2026 19:4335,666304,783,101295,026,0001,002,0002,113,536
8May 11, 2026 19:4335,684306,634,357295,180,0001,003,0002,113,536
9May 11, 2026 19:4335,898316,756,551294,865,0003,090,0002,113,536