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 27, 2026 18:35Karthik ReddyKarthik ReddyScore: 4,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 18:354,92551,174,69339,753,0001,127,0002,113,536
2Sep 27, 2026 18:354,93551,322,47239,816,0001,145,0002,113,536
3Sep 27, 2026 18:354,94251,251,59639,882,0001,140,0002,113,536
4Sep 27, 2026 18:354,95151,369,37440,013,0001,084,0002,113,536
5Sep 27, 2026 18:354,96751,436,39640,086,0001,145,0002,113,536
6Sep 27, 2026 18:354,97851,610,69940,171,0001,154,0002,113,536
7Sep 27, 2026 18:355,00757,222,12440,366,0001,197,0002,113,536
8Sep 27, 2026 18:355,03061,312,36440,740,0001,013,0002,113,536
9Sep 27, 2026 18:355,12957,433,97441,396,0001,180,0002,113,536