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 listNov 9, 2025 01:47izotoffizotoffScore: 62,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2025 01:3762,008539,622,890512,669,0001,998,0002,318,336
2Nov 9, 2025 01:4762,025540,547,291512,812,0001,999,0002,437,120
3Nov 9, 2025 01:3762,045542,969,457511,975,0002,999,0002,318,336
4Nov 9, 2025 01:3762,068539,455,074514,163,0001,000,0002,322,432
5Nov 9, 2025 01:4762,076539,135,010513,229,0002,000,0002,318,336
6Nov 9, 2025 01:4762,084538,265,869513,300,0002,001,0002,318,336