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 17:05Victor MerckléVictor MerckléScore: 3,700Success
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 17:053,69238,953,53129,536,0001,114,0002,113,536
2Aug 27, 2026 17:053,69238,964,25229,487,0001,158,0002,113,536
3Aug 27, 2026 17:053,69338,977,46929,463,0001,194,0002,113,536
4Aug 27, 2026 17:053,69738,834,15229,603,0001,087,0002,113,536
5Aug 27, 2026 17:053,70038,865,35829,624,0001,087,0002,113,536
6Aug 27, 2026 17:053,72839,176,23129,857,0001,086,0002,113,536
7Aug 27, 2026 17:053,73239,317,45129,859,0001,122,0002,113,536
8Aug 27, 2026 17:053,74440,136,79729,914,0001,169,0002,113,536
9Aug 27, 2026 17:053,75239,466,92029,995,0001,150,0002,113,536