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 8, 2025 23:22izotoffizotoffScore: 60,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 23:2260,517526,899,352501,291,0001,000,0002,510,848
2Nov 8, 2025 23:2260,527529,938,707502,374,00002,342,912
3Nov 8, 2025 23:2260,534533,384,989502,429,00002,502,656
4Nov 8, 2025 23:2260,549536,868,910500,555,0001,998,0002,514,944
5Nov 8, 2025 23:2260,553528,383,554500,588,0001,998,0002,543,616
6Nov 8, 2025 23:2260,554531,235,814502,595,00002,543,616
7Nov 8, 2025 23:2260,556528,656,465502,616,00002,281,472
8Nov 8, 2025 23:2260,557527,602,242501,623,000999,0002,539,520
9Nov 8, 2025 23:2260,557529,229,301499,623,0002,997,0002,523,136