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 3, 2026 02:28f0xerif0xeriScore: 34,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 02:3134,509296,046,083223,330,00063,102,0002,113,536
2Jul 3, 2026 02:3134,513296,537,510223,627,00062,836,0002,113,536
3Jul 3, 2026 02:3134,516296,146,642222,934,00063,549,0002,113,536
4Jul 3, 2026 02:3134,595296,703,704222,997,00064,148,0002,113,536
5Jul 3, 2026 02:3134,613297,221,544223,244,00064,047,0002,113,536
6Jul 3, 2026 02:3134,620296,925,262223,518,00063,834,0002,113,536
7Jul 3, 2026 02:3134,691297,914,487223,464,00064,477,0002,113,536
8Jul 3, 2026 02:3134,748298,297,720223,557,00064,853,0002,113,536
9Jul 3, 2026 02:3134,792298,277,756223,629,00065,147,0002,113,536