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 21:09Karthik ReddyKarthik ReddyScore: 18,476Success
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 21:0918,428163,238,642151,950,0001,007,0002,113,536
2Sep 24, 2026 21:0918,434163,304,825151,997,0001,006,0002,113,536
3Sep 24, 2026 21:0918,447163,365,591152,105,0001,006,0002,113,536
4Sep 24, 2026 21:0918,453163,450,831152,159,0001,006,0002,113,536
5Sep 24, 2026 21:0918,476164,789,888152,349,0001,007,0002,113,536
6Sep 24, 2026 21:0918,483163,718,048152,409,0001,007,0002,113,536
7Sep 24, 2026 21:0918,512163,907,718152,650,0001,004,0002,113,536
8Sep 24, 2026 21:0918,987167,815,715156,590,0001,007,0002,113,536
9Sep 24, 2026 21:0919,008167,979,748156,760,0001,007,0002,113,536