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 14:47Victor MerckléVictor MerckléScore: 5,799Success
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 14:525,77156,351,97246,775,0001,132,0002,113,536
2Aug 27, 2026 14:525,78356,498,47046,875,0001,129,0002,113,536
3Aug 27, 2026 14:525,78864,008,22246,915,0001,126,0002,113,536
4Aug 27, 2026 14:525,78958,430,40846,916,0001,134,0002,113,536
5Aug 27, 2026 14:525,79956,569,89347,000,0001,136,0002,113,536
6Aug 27, 2026 14:525,81356,660,76447,120,0001,129,0002,113,536
7Aug 27, 2026 14:525,81556,739,60247,074,0001,197,0002,113,536
8Aug 27, 2026 14:525,96757,986,97948,521,0001,011,0002,113,536
9Aug 27, 2026 14:525,96958,011,88348,440,0001,109,0002,113,536