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:02TonyTonyScore: 42,372Success
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:0242,360361,501,478350,588,0001,005,0002,113,536
2Aug 1, 2026 23:0242,369361,522,503350,662,0001,004,0002,113,536
3Aug 1, 2026 23:0242,371361,629,580350,679,0001,003,0002,113,536
4Aug 1, 2026 23:0242,372361,742,700350,687,0001,006,0002,113,536
5Aug 1, 2026 23:0242,372361,558,705350,691,0001,003,0002,113,536
6Aug 1, 2026 23:0242,379361,805,086350,747,0001,005,0002,113,536
7Aug 1, 2026 23:0242,381362,192,827350,764,0001,003,0002,113,536
8Aug 1, 2026 23:0242,385361,819,618350,795,0001,003,0002,113,536
9Aug 1, 2026 23:0242,400361,988,416349,917,0002,009,0002,113,536