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 listMar 24, 2026 01:13Ondřej PolaneckýOndřej PolaneckýScore: 9,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 01:139,619103,667,36277,839,0001,995,0002,289,664
2Mar 24, 2026 01:139,621111,181,37477,862,0001,996,0002,293,760
3Mar 24, 2026 01:139,699101,862,84679,497,0001,006,0002,523,136