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 30, 2026 07:09Saif Al-HarthiSaif Al-HarthiScore: 15,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 07:0915,115134,796,512124,453,0001,008,0002,113,536
2Jun 30, 2026 07:0915,152135,126,434124,756,0001,008,0002,113,536
3Jun 30, 2026 07:0915,168135,272,840124,892,0001,010,0002,113,536
4Jun 30, 2026 07:0915,177135,283,403124,965,0001,009,0002,113,536
5Jun 30, 2026 07:0915,268136,054,903125,718,0001,010,0002,113,536
6Jun 30, 2026 07:0915,294136,261,034125,935,0001,011,0002,113,536
7Jun 30, 2026 07:0915,346136,651,247126,100,0001,275,0002,113,536
8Jun 30, 2026 07:0915,385136,998,870126,683,0001,013,0002,113,536
9Jun 30, 2026 07:0915,516138,109,802127,775,0001,011,0002,113,536