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 listSep 29, 2026 15:58parastromparastromScore: 4,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 16:004,30946,535,58834,683,0001,088,0002,113,536
2Sep 29, 2026 16:004,31646,365,49134,779,0001,046,0002,113,536
3Sep 29, 2026 16:004,33546,416,11634,872,0001,112,0002,113,536
4Sep 29, 2026 16:004,35046,586,95035,034,0001,078,0002,113,536
5Sep 29, 2026 16:004,38546,954,61035,309,0001,091,0002,113,536
6Sep 29, 2026 16:004,38847,033,01435,295,0001,128,0002,113,536
7Sep 29, 2026 16:004,41747,205,74935,541,0001,127,0002,113,536
8Sep 29, 2026 16:004,42447,141,00335,570,0001,152,0002,113,536
9Sep 29, 2026 16:004,44247,385,87235,751,0001,122,0002,113,536