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 listMay 25, 2026 21:11Maya RebholzMaya RebholzScore: 6,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 21:116,06160,694,60244,827,0005,484,0002,117,632
2May 25, 2026 21:116,06461,597,26544,760,0005,572,0002,117,632
3May 25, 2026 21:116,08963,483,21844,922,0005,621,0002,113,536
4May 25, 2026 21:116,09662,793,44545,099,0005,502,0002,117,632
5May 25, 2026 21:116,13863,691,92645,429,0005,523,0002,113,536
6May 25, 2026 21:116,18363,827,17645,692,0005,629,0002,117,632
7May 25, 2026 21:116,22063,350,58846,273,0005,353,0002,117,632
8May 25, 2026 21:116,24263,992,46846,183,0005,628,0002,117,632
9May 25, 2026 21:116,33462,611,68146,800,0005,775,0002,117,632