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 8, 2026 20:21Adam FolwarcznyAdam FolwarcznyScore: 57,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 20:2157,474486,587,815476,007,0001,034,0002,113,536
2Jul 8, 2026 20:2157,484486,552,479475,950,0001,173,0002,113,536
3Jul 8, 2026 20:2157,510486,798,211476,296,0001,037,0002,113,536
4Jul 8, 2026 20:2157,513487,359,933476,247,0001,116,0002,113,536
5Jul 8, 2026 20:2157,551487,243,383476,591,0001,088,0002,113,536
6Jul 8, 2026 20:2157,563487,275,809476,775,0001,001,0002,113,536
7Jul 8, 2026 20:2157,630487,923,059477,233,0001,103,0002,113,536
8Jul 8, 2026 20:2157,676488,291,886477,590,0001,125,0002,113,536
9Jul 8, 2026 20:2157,697488,471,773477,861,0001,028,0002,113,536