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 05:28Ashish AhujaAshish AhujaScore: 2,067,281Success
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 05:282,066,68917,186,041,26917,084,547,00068,969,0002,281,472
2Aug 8, 2025 05:282,067,28117,193,218,05017,087,466,00070,964,0002,277,376
3Aug 8, 2025 05:282,067,58017,191,511,60817,093,943,00066,972,0002,277,376