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 29, 2026 14:47Saif Al-HarthiSaif Al-HarthiScore: 18,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 14:4918,256160,733,222150,526,0001,006,0002,113,536
2Jun 29, 2026 14:4918,429162,770,355151,961,0001,004,0002,113,536
3Jun 29, 2026 14:4918,445162,332,447152,093,0001,004,0002,113,536
4Jun 29, 2026 14:4918,483162,720,580152,406,0001,006,0002,113,536
5Jun 29, 2026 14:4918,501162,916,564152,557,0001,004,0002,113,536
6Jun 29, 2026 14:4918,505162,893,872152,593,0001,004,0002,113,536
7Jun 29, 2026 14:4918,534163,404,369151,806,0002,033,0002,113,536
8Jun 29, 2026 14:4918,608163,742,177153,447,0001,004,0002,113,536
9Jun 29, 2026 14:4918,624163,896,281153,579,0001,005,0002,113,536