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 2, 2026 21:23TonyTonyScore: 10,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 21:2410,45196,689,15584,216,0002,532,0002,113,536
2Aug 2, 2026 21:2410,47496,777,66484,449,0002,487,0002,113,536
3Aug 2, 2026 21:2410,52297,157,99084,629,0002,706,0002,113,536
4Aug 2, 2026 21:2410,54398,529,41285,041,0002,467,0002,113,536
5Aug 2, 2026 21:2410,56797,484,77285,180,0002,529,0002,113,536
6Aug 2, 2026 21:2410,65198,242,27085,706,0002,700,0002,113,536
7Aug 2, 2026 21:2410,65598,357,62185,762,0002,681,0002,113,536
8Aug 2, 2026 21:2410,74198,971,22086,484,0002,669,0002,113,536
9Aug 2, 2026 21:2410,84399,897,09487,489,0002,513,0002,113,536