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 listJun 19, 2026 00:07Omkar SinghOmkar SinghScore: 529,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 00:08528,6514,397,649,1434,322,626,00065,181,0002,113,536
2Jun 19, 2026 00:08528,9974,400,315,5744,326,630,00064,053,0002,113,536
3Jun 19, 2026 00:08529,2444,402,243,8254,326,674,00066,054,0002,113,536
4Jun 19, 2026 00:08529,2474,402,134,3984,328,693,00064,061,0002,113,536
5Jun 19, 2026 00:08529,5284,404,749,7424,330,914,00064,174,0002,113,536
6Jun 19, 2026 00:08529,8784,407,364,4764,332,858,00065,130,0002,113,536
7Jun 19, 2026 00:08531,6264,421,849,9364,349,443,00063,059,0002,113,536
8Jun 19, 2026 00:08538,3634,477,895,5314,404,365,00064,054,0002,113,536
9Jun 19, 2026 00:08548,3374,560,678,0494,485,935,00065,266,0002,113,536