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 2, 2026 15:19Karthik ReddyKarthik ReddyScore: 3,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 15:203,2463,036,032,67226,948,000020,480
2Oct 2, 2026 15:203,2613,036,069,95527,073,000020,480
3Oct 2, 2026 15:203,2643,036,110,46527,092,000020,480
4Oct 2, 2026 15:203,2733,036,308,58827,168,000020,480
5Oct 2, 2026 15:203,2783,036,361,96727,214,000020,480
6Oct 2, 2026 15:203,2803,036,239,45027,226,000020,480
7Oct 2, 2026 15:203,2843,036,399,80327,261,000020,480
8Oct 2, 2026 15:203,2863,036,299,03227,278,000020,480
9Oct 2, 2026 15:203,2873,036,445,65326,280,0001,008,00020,480