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 27, 2026 06:40Victor MerckléVictor MerckléScore: 4,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 06:413,90040,754,77331,240,0001,137,0002,113,536
2Aug 27, 2026 06:414,04641,983,84732,494,0001,091,0002,113,536
3Aug 27, 2026 06:414,05642,703,49732,597,0001,068,0002,113,536
4Aug 27, 2026 06:414,09642,337,10132,874,0001,126,0002,113,536
5Aug 27, 2026 06:414,10043,082,60832,904,0001,132,0002,113,536
6Aug 27, 2026 06:414,12242,590,47333,154,0001,066,0002,113,536
7Aug 27, 2026 06:414,13242,736,35533,238,0001,065,0002,113,536
8Aug 27, 2026 06:414,14142,721,91233,308,0001,068,0002,113,536
9Aug 27, 2026 06:414,16743,631,81033,469,0001,119,0002,113,536