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 listJul 16, 2026 09:07boop34boop34Score: 9,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 09:089,18085,841,24075,188,0001,009,0002,113,536
2Jul 16, 2026 09:089,21286,042,15575,436,0001,026,0002,113,536
3Jul 16, 2026 09:089,22186,022,89975,445,0001,090,0002,113,536
4Jul 16, 2026 09:089,22186,144,94075,530,0001,010,0002,113,536
5Jul 16, 2026 09:089,22686,132,95575,551,0001,030,0002,113,536
6Jul 16, 2026 09:089,23986,211,34275,681,0001,007,0002,113,536
7Jul 16, 2026 09:089,24286,250,43275,707,0001,006,0002,113,536
8Jul 16, 2026 09:089,26286,390,61375,871,0001,009,0002,113,536
9Jul 16, 2026 09:089,29486,860,79976,142,0001,005,0002,113,536