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 28, 2025 13:03zielajzielajScore: 25,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2025 13:0324,986147,793,662122,431,00002,338,816
2Jul 28, 2025 13:0324,991146,949,491122,455,00002,457,600
3Jul 28, 2025 13:0325,007147,141,171121,529,0001,004,0002,301,952
4Jul 28, 2025 13:0325,015149,683,957121,576,000996,0002,465,792
5Jul 28, 2025 13:0325,019147,341,840121,588,0001,004,0002,314,240
6Jul 28, 2025 13:0325,039145,005,095121,696,000997,0002,469,888
7Jul 28, 2025 13:0325,040148,793,441122,696,00002,322,432
8Jul 28, 2025 13:0325,607150,493,254125,474,00002,310,144
9Jul 28, 2025 13:0326,774152,790,973130,194,0001,001,0002,490,368