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 15:08Daniel MastalerzDaniel MastalerzScore: 4,299Success
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 15:094,28745,096,08534,539,0001,045,0002,113,536
2Jun 27, 2026 15:094,29045,073,30334,565,0001,043,0002,113,536
3Jun 27, 2026 15:094,29145,107,00234,568,0001,050,0002,113,536
4Jun 27, 2026 15:094,29745,201,11434,603,0001,065,0002,113,536
5Jun 27, 2026 15:094,29945,214,75534,625,0001,062,0002,113,536
6Jun 27, 2026 15:094,30045,500,89934,647,0001,050,0002,113,536
7Jun 27, 2026 15:094,30346,442,10434,662,0001,055,0002,113,536
8Jun 27, 2026 15:094,31545,308,89434,774,0001,043,0002,113,536
9Jun 27, 2026 15:094,32245,378,18034,629,0001,250,0002,113,536