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 listSep 30, 2026 18:12Karthik ReddyKarthik ReddyScore: 3,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 18:133,43738,894,62127,471,0001,057,0002,113,536
2Sep 30, 2026 18:133,43838,358,43127,438,0001,104,0002,113,536
3Sep 30, 2026 18:133,44137,383,62827,407,0001,157,0002,113,536
4Sep 30, 2026 18:133,44738,042,51227,443,0001,168,0002,113,536
5Sep 30, 2026 18:133,44737,957,44127,464,0001,152,0002,113,536
6Sep 30, 2026 18:133,45138,083,78327,481,0001,168,0002,113,536
7Sep 30, 2026 18:133,45437,548,42127,508,0001,162,0002,113,536
8Sep 30, 2026 18:133,46638,273,91027,606,0001,162,0002,113,536
9Sep 30, 2026 18:133,47637,815,25227,674,0001,178,0002,113,536