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:38Kevin HeaveyKevin HeaveyScore: 53,441Success
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:5653,117271,082,819249,886,00010,392,00020,480
2Jul 27, 2026 13:5653,137271,102,607250,298,00010,078,00020,480
3Jul 27, 2026 13:5653,270271,812,601249,947,00011,076,00020,480
4Jul 27, 2026 13:5653,419271,847,480250,588,00011,169,00020,480
5Jul 27, 2026 13:5653,441272,017,497249,760,00012,101,00020,480
6Jul 27, 2026 13:5653,524272,358,042249,906,00012,362,00020,480
7Jul 27, 2026 13:5653,551273,126,090249,846,00012,554,00020,480
8Jul 27, 2026 13:5653,569273,233,529249,659,00012,831,0002,113,536
9Jul 27, 2026 13:5653,577272,638,902249,951,00012,578,00020,480