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 18, 2025 13:34Ashish AhujaAshish AhujaScore: 11,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 13:3410,999116,379,05586,279,0005,016,0002,355,200
2Aug 18, 2025 13:3411,036116,298,19283,632,0007,965,0002,273,280
3Aug 18, 2025 13:3411,061116,353,26584,825,0006,985,0002,400,256
4Aug 18, 2025 13:3411,233120,055,03588,221,0005,012,0002,326,528
5Aug 18, 2025 13:3411,288122,414,95687,707,0005,980,0002,420,736
6Aug 18, 2025 13:3411,423121,934,95287,828,0006,986,0002,478,080