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 11:54Kevin HeaveyKevin HeaveyScore: 67,967Success
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 11:5667,342339,884,778320,772,0009,204,00020,480
2Jul 27, 2026 11:5667,569340,937,251320,931,00010,160,00020,480
3Jul 27, 2026 11:5667,624341,175,467320,441,00010,921,0002,113,536
4Jul 27, 2026 11:5667,960342,845,111320,873,00012,132,00020,480
5Jul 27, 2026 11:5667,967342,925,605321,335,00011,707,00020,480
6Jul 27, 2026 11:5668,156345,431,561321,459,00012,507,00020,480
7Jul 27, 2026 11:5668,175343,951,677320,816,00013,242,00020,480
8Jul 27, 2026 11:5668,664346,258,368321,272,00015,186,00020,480
9Jul 27, 2026 11:5668,730346,667,218321,029,00015,752,00020,480