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 3, 2026 21:22anboto1anboto1Score: 57,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:2357,526290,977,935280,733,0001,147,0002,113,536
2Aug 3, 2026 21:2357,537291,159,127280,772,0001,164,0002,113,536
3Aug 3, 2026 21:2357,585291,044,321281,073,0001,098,0002,113,536
4Aug 3, 2026 21:2357,588291,313,591281,095,0001,088,0002,113,536
5Aug 3, 2026 21:2357,624291,374,255281,261,0001,100,0002,113,536
6Aug 3, 2026 21:2357,673291,722,612281,509,0001,093,0002,113,536
7Aug 3, 2026 21:2357,821292,504,772282,140,0001,183,0002,113,536
8Aug 3, 2026 21:2357,931292,918,039282,753,0001,109,0002,113,536
9Aug 3, 2026 21:2359,129298,785,059288,612,0001,122,0002,113,536