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 1, 2026 07:24Karthik ReddyKarthik ReddyScore: 3,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 07:243,46438,137,16027,695,0001,057,0002,113,536
2Oct 1, 2026 07:243,46938,270,21727,672,0001,126,0002,113,536
3Oct 1, 2026 07:243,47238,362,15527,681,0001,142,0002,113,536
4Oct 1, 2026 07:243,47238,314,76727,698,0001,127,0002,113,536
5Oct 1, 2026 07:243,47438,354,70327,674,0001,161,0002,113,536
6Oct 1, 2026 07:243,47637,762,88827,716,0001,135,0002,113,536
7Oct 1, 2026 07:243,47637,805,66927,720,0001,135,0002,113,536
8Oct 1, 2026 07:243,47838,255,53227,743,0001,127,0002,113,536
9Oct 1, 2026 07:243,47937,777,62027,758,0001,122,0002,113,536