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 10:30Victor MerckléVictor MerckléScore: 3,931Success
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 10:303,89440,665,94431,188,0001,139,0002,113,536
2Aug 27, 2026 10:303,89840,508,44231,242,0001,117,0002,113,536
3Aug 27, 2026 10:303,89840,634,09631,230,0001,125,0002,113,536
4Aug 27, 2026 10:303,90841,422,61031,255,0001,182,0002,113,536
5Aug 27, 2026 10:303,93140,899,07231,528,0001,103,0002,113,536
6Aug 27, 2026 10:303,93540,806,86731,525,0001,141,0002,113,536
7Aug 27, 2026 10:303,96041,108,69931,792,0001,080,0002,113,536
8Aug 27, 2026 10:303,96041,181,07831,789,0001,084,0002,113,536
9Aug 27, 2026 10:304,00041,790,92932,104,0001,096,0002,113,536