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 listJun 28, 2026 09:00A_ShamanA_ShamanScore: 36,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:0036,980316,259,003305,810,0001,132,0002,113,536
2Jun 28, 2026 09:0036,987316,320,206305,844,0001,151,0002,113,536
3Jun 28, 2026 09:0036,989316,335,321305,926,0001,086,0002,113,536
4Jun 28, 2026 09:0036,990317,525,769305,893,0001,129,0002,113,536
5Jun 28, 2026 09:0036,996316,333,910305,931,0001,137,0002,113,536
6Jun 28, 2026 09:0036,998316,420,702305,983,0001,103,0002,113,536
7Jun 28, 2026 09:0037,003316,407,543305,959,0001,168,0002,113,536
8Jun 28, 2026 09:0037,004316,400,216305,988,0001,148,0002,113,536
9Jun 28, 2026 09:0037,006316,489,416305,939,0001,213,0002,113,536