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 listJun 17, 2026 09:44DavidDavidScore: 45,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 09:4445,243384,582,547374,514,0001,003,0002,113,536
2Jun 17, 2026 09:4445,257384,706,497374,636,0001,005,0002,113,536
3Jun 17, 2026 09:4445,283384,949,316374,848,0001,003,0002,113,536
4Jun 17, 2026 09:4445,319385,237,758375,143,0001,005,0002,113,536
5Jun 17, 2026 09:4445,327385,228,508375,214,0001,004,0002,113,536
6Jun 17, 2026 09:4445,351385,597,636375,412,0001,003,0002,113,536
7Jun 17, 2026 09:4445,638387,846,513377,797,0001,004,0002,113,536
8Jun 17, 2026 09:4445,653387,981,756377,918,0001,005,0002,113,536
9Jun 17, 2026 09:4445,690388,325,751378,225,0001,006,0002,113,536