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 00:38izotoffizotoffScore: 61,523Success
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 00:4361,476531,282,345510,253,00002,543,616
2Nov 9, 2025 00:4361,506537,513,719507,496,0003,002,0002,543,616
3Nov 9, 2025 00:3861,523539,913,580508,640,0001,998,0002,543,616
4Nov 9, 2025 00:4361,523540,008,650507,645,0002,997,0002,543,616
5Nov 9, 2025 00:3861,525531,872,900509,661,000999,0002,375,680
6Nov 9, 2025 00:3861,553536,882,743508,890,0001,999,0002,506,752