Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listAug 15, 2026 20:22Tomislav TunkovicTomislav TunkovicScore: 30,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 20:2330,276157,486,073147,341,0001,012,00020,480
2Aug 15, 2026 20:2330,277157,598,043147,348,0001,011,00020,480
3Aug 15, 2026 20:2330,423158,332,541148,066,0001,009,00020,480
4Aug 15, 2026 20:2330,425157,543,703147,053,0002,032,00020,480
5Aug 15, 2026 20:2330,481158,995,961148,346,0001,011,00020,480
6Aug 15, 2026 20:2330,872160,382,270150,266,0001,010,00020,480
7Aug 15, 2026 20:2331,152161,115,522151,637,0001,011,00020,480
8Aug 15, 2026 20:2331,896164,760,557155,282,0001,010,00020,480
9Aug 15, 2026 20:2333,013170,241,719160,757,0001,011,00020,480