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:32Tomislav TunkovicTomislav TunkovicScore: 29,662Success
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:3429,463152,914,061143,363,0001,009,00020,480
2Aug 15, 2026 20:3429,575154,058,424143,912,0001,009,00020,480
3Aug 15, 2026 20:3429,598153,485,614144,023,0001,010,00020,480
4Aug 15, 2026 20:3429,607154,579,600144,068,0001,009,00020,480
5Aug 15, 2026 20:3429,662153,784,928144,339,0001,009,00020,480
6Aug 15, 2026 20:3429,674153,896,647144,396,0001,010,00020,480
7Aug 15, 2026 20:3430,339157,848,160147,654,0001,010,00020,480
8Aug 15, 2026 20:3430,418158,265,308148,043,0001,010,00020,480
9Aug 15, 2026 20:3432,149166,033,750156,524,0001,010,00020,480