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 listJul 31, 2026 17:50anboto1anboto1Score: 176,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:51175,019867,874,131856,412,0001,182,0002,113,536
2Jul 31, 2026 17:51175,842871,903,880860,439,0001,187,0002,113,536
3Jul 31, 2026 17:51175,875872,729,640860,599,0001,189,0002,113,536
4Jul 31, 2026 17:51176,005872,636,706861,248,0001,177,0002,113,536
5Jul 31, 2026 17:51176,059872,891,410861,516,0001,177,0002,113,536
6Jul 31, 2026 17:51176,258874,650,690862,484,0001,183,0002,113,536
7Jul 31, 2026 17:51176,529875,267,170863,818,0001,178,0002,113,536
8Jul 31, 2026 17:51177,261879,545,495867,398,0001,182,0002,113,536
9Jul 31, 2026 17:51177,653880,618,717869,315,0001,187,0002,113,536