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 listAug 1, 2026 23:23TonyTonyScore: 28,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 23:2328,739248,540,398237,531,0001,007,0002,113,536
2Aug 1, 2026 23:2328,741248,624,300237,544,0001,007,0002,113,536
3Aug 1, 2026 23:2328,750248,528,242237,622,0001,009,0002,113,536
4Aug 1, 2026 23:2328,750248,700,178237,617,0001,008,0002,113,536
5Aug 1, 2026 23:2328,773248,689,745237,803,0001,016,0002,113,536
6Aug 1, 2026 23:2328,784248,842,512237,901,0001,007,0002,113,536
7Aug 1, 2026 23:2328,831249,301,383238,297,0001,007,0002,113,536
8Aug 1, 2026 23:2328,969250,526,872239,436,0001,007,0002,113,536
9Aug 1, 2026 23:2328,977250,490,934239,506,0001,008,0002,113,536