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 17:43Tomislav TunkovicTomislav TunkovicScore: 32,860Success
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 17:4431,716163,867,447153,396,0002,016,00020,480
2Aug 15, 2026 17:4431,751164,711,272154,574,0001,010,00020,480
3Aug 15, 2026 17:4431,920164,884,374155,397,0001,011,00020,480
4Aug 15, 2026 17:4432,846170,080,850159,937,0001,013,00020,480
5Aug 15, 2026 17:4432,860169,438,140160,008,0001,008,00020,480
6Aug 15, 2026 17:4432,863169,490,243160,017,0001,015,00020,480
7Aug 15, 2026 17:4433,113171,295,192161,241,0001,013,00020,480
8Aug 15, 2026 17:4433,520172,721,652163,240,0001,012,00020,480
9Aug 15, 2026 17:4433,624173,225,522163,747,0001,013,00020,480