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 24, 2026 19:13Karthik ReddyKarthik ReddyScore: 34,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:1433,512288,428,170277,149,0001,004,0002,113,536
2Sep 24, 2026 19:1433,546288,688,941277,433,0001,003,0002,113,536
3Sep 24, 2026 19:1433,625289,269,137278,090,0001,003,0002,113,536
4Sep 24, 2026 19:1434,843299,530,512288,183,0001,015,0002,113,536
5Sep 24, 2026 19:1434,856299,707,552288,302,0001,003,0002,113,536
6Sep 24, 2026 19:1434,856299,596,678288,310,0001,003,0002,113,536
7Sep 24, 2026 19:1434,857299,676,683288,317,0001,004,0002,113,536
8Sep 24, 2026 19:1434,859300,353,266288,329,0001,005,0002,113,536
9Sep 24, 2026 19:1434,861299,677,709288,345,0001,002,0002,113,536