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 listOct 16, 2026 18:05KacpxerKacpxerScore: 12,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:0512,112111,001,28299,533,0001,004,0002,113,536
2Oct 16, 2026 18:0512,146111,315,16799,805,0001,008,0002,113,536
3Oct 16, 2026 18:0512,147111,395,38699,737,0001,087,0002,113,536
4Oct 16, 2026 18:0512,150111,422,41699,758,0001,091,0002,113,536
5Oct 16, 2026 18:0512,162111,401,32599,861,0001,087,0002,113,536
6Oct 16, 2026 18:0512,179111,535,211100,088,0001,005,0002,113,536
7Oct 16, 2026 18:0512,180111,527,725100,089,0001,005,0002,113,536
8Oct 16, 2026 18:0512,181111,603,948100,027,0001,077,0002,113,536
9Oct 16, 2026 18:0512,213111,866,722100,287,0001,081,0002,113,536