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 8, 2025 15:22Ashish AhujaAshish AhujaScore: 2,698,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 15:222,695,07928,290,411,88520,382,498,0001,986,658,0002,375,680
2Aug 8, 2025 15:222,698,41028,240,570,22220,374,083,0002,022,724,0002,416,640
3Aug 8, 2025 15:222,699,14028,326,087,19720,471,526,0001,931,332,0002,310,144