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 27, 2026 12:23Kevin HeaveyKevin HeaveyScore: 57,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 12:2856,894289,491,045269,724,0009,059,00020,480
2Jul 27, 2026 12:2857,038291,123,209270,475,0009,013,00020,480
3Jul 27, 2026 12:2857,086290,010,061270,324,0009,402,00020,480
4Jul 27, 2026 12:2857,279290,788,256269,658,00011,010,00020,480
5Jul 27, 2026 12:2857,294290,792,073270,052,00010,691,00020,480
6Jul 27, 2026 12:2857,315290,827,727270,523,00010,322,00020,480
7Jul 27, 2026 12:2857,337290,978,455270,213,00010,739,0002,113,536
8Jul 27, 2026 12:2857,438291,452,267270,267,00011,182,00020,480
9Jul 27, 2026 12:2857,535295,547,998270,915,00011,011,00020,480