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 listMay 5, 2025 07:31parsersmailparsersmailScore: 82,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2025 07:3182,756713,282,454685,878,000999,0002,342,912
2May 5, 2025 07:3182,800720,606,319686,242,0001,000,0002,322,432
3May 5, 2025 07:3182,860712,151,079685,741,0001,999,0002,322,432