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 8, 2026 12:07chereshnya123chereshnya123Score: 58,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 12:0858,429494,105,365427,577,00057,387,0002,113,536
2Jun 8, 2026 12:0858,443495,814,360427,474,00057,603,0002,113,536
3Jun 8, 2026 12:0858,455494,227,567427,456,00057,721,0002,113,536
4Jun 8, 2026 12:0858,496494,602,929427,714,00057,811,0002,113,536
5Jun 8, 2026 12:0858,527494,898,217427,709,00058,067,0002,113,536
6Jun 8, 2026 12:0858,534495,386,459427,535,00058,300,0002,113,536
7Jun 8, 2026 12:0858,549495,498,150427,382,00058,578,0002,113,536
8Jun 8, 2026 12:0858,635495,804,106427,664,00059,014,0002,113,536
9Jun 8, 2026 12:0858,759496,779,338428,512,00059,194,0002,113,536