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 10, 2023 18:12temporary-enlightenmenttemporary-enlightenmentScore: 58,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2023 18:1258,274541,932,406483,672,39302,293,760
2Aug 10, 2023 18:1258,288547,017,430483,791,00402,277,376
3Aug 10, 2023 18:1258,333546,959,185484,163,48702,289,664