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 2, 2026 06:53Karthik ReddyKarthik ReddyScore: 3,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 06:563,85442,467,79130,745,0001,245,0002,113,536
2Oct 2, 2026 06:563,85640,936,14530,883,0001,128,0002,113,536
3Oct 2, 2026 06:563,85740,978,17930,786,0001,232,0002,113,536
4Oct 2, 2026 06:563,86341,037,83830,920,0001,149,0002,113,536
5Oct 2, 2026 06:563,86641,088,60030,880,0001,209,0002,113,536
6Oct 2, 2026 06:563,86941,105,16630,894,0001,223,0002,113,536
7Oct 2, 2026 06:563,87041,243,68430,927,0001,200,0002,113,536
8Oct 2, 2026 06:563,88041,170,36031,007,0001,204,0002,113,536
9Oct 2, 2026 06:563,88141,159,34031,007,0001,212,0002,113,536