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 26, 2026 20:51Victor MerckléVictor MerckléScore: 7,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:526,97066,954,20356,705,0001,151,0002,113,536
2Aug 26, 2026 20:527,02866,492,60157,269,0001,070,0002,113,536
3Aug 26, 2026 20:527,04066,703,61957,365,0001,069,0002,113,536
4Aug 26, 2026 20:527,04067,373,89557,280,0001,153,0002,113,536
5Aug 26, 2026 20:527,04166,771,57057,344,0001,104,0002,113,536
6Aug 26, 2026 20:527,05066,812,09857,424,0001,099,0002,113,536
7Aug 26, 2026 20:527,08767,212,75857,670,0001,160,0002,113,536
8Aug 26, 2026 20:527,13467,522,88658,104,0001,109,0002,113,536
9Aug 26, 2026 20:527,22968,257,52358,925,0001,082,0002,113,536