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 08:26Karthik ReddyKarthik ReddyScore: 3,418Success
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 08:273,40237,085,31227,134,0001,104,0002,113,536
2Oct 1, 2026 08:273,40337,298,53627,164,0001,085,0002,113,536
3Oct 1, 2026 08:273,40437,653,76827,179,0001,080,0002,113,536
4Oct 1, 2026 08:273,41537,329,45827,234,0001,111,0002,113,536
5Oct 1, 2026 08:273,41837,402,64927,288,0001,084,0002,113,536
6Oct 1, 2026 08:273,43137,489,90727,386,0001,094,0002,113,536
7Oct 1, 2026 08:273,44837,659,38827,444,0001,176,0002,113,536
8Oct 1, 2026 08:273,45337,691,78327,534,0001,134,0002,113,536
9Oct 1, 2026 08:273,45737,819,60727,512,0001,182,0002,113,536