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 27, 2026 13:25Daniel MastalerzDaniel MastalerzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:26045,958,20435,260,0001,043,0002,113,536expected "53682227048153313 ", got "53682224488153313"
2Jun 27, 2026 13:264,34645,539,00135,044,0001,033,0002,113,536
3Jun 27, 2026 13:264,35045,609,31935,061,0001,045,0002,113,536
4Jun 27, 2026 13:264,36045,633,61735,155,0001,035,0002,113,536
5Jun 27, 2026 13:264,36645,740,64135,210,0001,030,0002,113,536
6Jun 27, 2026 13:264,36845,784,14035,216,0001,042,0002,113,536
7Jun 27, 2026 13:264,37245,818,60035,257,0001,033,0002,113,536
8Jun 27, 2026 13:264,39545,857,85535,455,0001,028,0002,113,536
9Jun 27, 2026 13:264,40646,079,76035,520,0001,050,0002,113,536