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 13:32Kevin HeaveyKevin HeaveyScore: 57,323Success
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 13:4956,771287,985,706268,621,0009,560,00020,480
2Jul 27, 2026 13:4956,897288,688,161268,461,00010,339,0002,113,536
3Jul 27, 2026 13:4957,004289,242,327269,432,0009,892,00020,480
4Jul 27, 2026 13:4957,225290,369,347269,067,00011,339,00020,480
5Jul 27, 2026 13:4957,323290,926,738268,437,00012,448,0002,113,536
6Jul 27, 2026 13:4957,357290,928,465269,046,00012,004,00020,480
7Jul 27, 2026 13:4957,393291,121,811268,783,00012,444,00020,480
8Jul 27, 2026 13:4957,396291,409,930269,271,00011,971,00020,480
9Jul 27, 2026 13:4957,548291,847,351268,934,00013,055,0002,113,536