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 25, 2026 16:46Victor MerckléVictor MerckléScore: 5,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 16:475,47952,967,11844,396,0001,087,0002,113,536
2Jun 25, 2026 16:475,48253,007,89944,405,0001,096,0002,113,536
3Jun 25, 2026 16:475,48753,223,02644,387,0001,159,0002,113,536
4Jun 25, 2026 16:475,48953,118,14844,470,0001,093,0002,113,536
5Jun 25, 2026 16:475,49053,097,46544,475,0001,094,0002,113,536
6Jun 25, 2026 16:475,50853,323,17744,619,0001,101,0002,113,536
7Jun 25, 2026 16:475,51353,356,49644,735,0001,028,0002,113,536
8Jun 25, 2026 16:475,52953,434,67344,820,0001,075,0002,113,536
9Jun 25, 2026 16:475,56353,772,20245,066,0001,110,0002,113,536