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 17, 2025 07:21Ashish AhujaAshish AhujaScore: 14,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 07:2114,626149,987,998106,468,00014,925,0002,334,720
2Aug 17, 2025 07:2114,631149,274,915107,506,00013,935,0002,482,176
3Aug 17, 2025 07:2114,750149,243,799109,489,00012,939,0002,424,832