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 30, 2026 16:41boop34boop34Score: 20,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 16:4120,874183,082,576172,149,0001,108,0002,113,536
2Jul 30, 2026 16:4120,882183,196,474172,219,0001,108,0002,113,536
3Jul 30, 2026 16:4120,883183,240,989172,221,0001,114,0002,113,536
4Jul 30, 2026 16:4120,885183,185,173172,246,0001,100,0002,113,536
5Jul 30, 2026 16:4120,940184,323,030172,709,0001,101,0002,113,536
6Jul 30, 2026 16:4120,955183,796,489172,806,0001,122,0002,113,536
7Jul 30, 2026 16:4120,969183,894,485172,844,0001,200,0002,113,536
8Jul 30, 2026 16:4120,972183,984,607172,888,0001,184,0002,113,536
9Jul 30, 2026 16:4120,976184,032,738172,924,0001,178,0002,113,536