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:51Kevin HeaveyKevin HeaveyScore: 54,222Success
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:0553,760273,431,051252,180,00011,246,0002,113,536
2Jul 27, 2026 13:0553,837273,900,234253,123,00010,683,00020,480
3Jul 27, 2026 13:0554,003274,712,313253,199,00011,419,0002,113,536
4Jul 27, 2026 13:0554,090275,900,804252,529,00012,516,00020,480
5Jul 27, 2026 13:0554,222275,716,265253,159,00012,529,00020,480
6Jul 27, 2026 13:0554,232275,793,278252,981,00012,759,00020,480
7Jul 27, 2026 13:0554,239279,765,907253,124,00012,649,00020,480
8Jul 27, 2026 13:0554,253275,894,463253,153,00012,687,00020,480
9Jul 27, 2026 13:0554,308276,135,215253,039,00013,075,00020,480