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 15:14George SeabridgeGeorge SeabridgeScore: 50,345Success
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 15:1542,795365,237,526354,116,0001,085,0002,113,536
2Aug 1, 2026 15:1543,236369,582,416357,783,0001,084,0002,113,536
3Aug 1, 2026 15:1543,628372,189,483361,026,0001,093,0002,113,536
4Aug 1, 2026 15:1546,095392,556,626381,580,0001,011,0002,113,536
5Aug 1, 2026 15:1550,345429,766,676416,769,0001,099,0002,113,536
6Aug 1, 2026 15:1551,152434,539,759423,461,0001,103,0002,113,536
7Aug 1, 2026 15:1551,337436,943,386424,998,0001,103,0002,113,536
8Aug 1, 2026 15:1551,507437,557,227426,416,0001,098,0002,113,536
9Aug 1, 2026 15:1551,626439,475,580427,406,0001,098,0002,113,536