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:05Kevin HeaveyKevin HeaveyScore: 62,759Success
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:1462,258314,875,341292,688,00012,379,0002,113,536
2Jul 27, 2026 12:1462,628316,656,295296,185,00010,694,0002,113,536
3Jul 27, 2026 12:1462,642316,847,318293,331,00013,617,0002,113,536
4Jul 27, 2026 12:1462,685317,053,776296,222,00010,935,0002,113,536
5Jul 27, 2026 12:1462,759317,238,028293,018,00014,505,00020,480
6Jul 27, 2026 12:1463,112319,136,006296,285,00012,965,0002,113,536
7Jul 27, 2026 12:1463,391320,526,018296,084,00014,532,0002,113,536
8Jul 27, 2026 12:1463,425320,674,855296,409,00014,377,00020,480
9Jul 27, 2026 12:1463,462322,320,890296,410,00014,556,0002,113,536