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 listMay 20, 2026 15:49M-RochatM-RochatScore: 110,605Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:49110,430552,724,584539,978,0001,131,0002,113,536
2May 20, 2026 15:49110,451550,627,734540,075,0001,135,0002,113,536
3May 20, 2026 15:49110,484552,255,660540,248,0001,127,0002,113,536
4May 20, 2026 15:49110,572551,271,399540,675,0001,128,0002,113,536
5May 20, 2026 15:49110,605552,408,131540,852,0001,116,0002,113,536
6May 20, 2026 15:49110,980555,451,999542,675,0001,130,0002,113,536
7May 20, 2026 15:49110,985553,311,200542,699,0001,132,0002,113,536
8May 20, 2026 15:49111,120554,863,037543,357,0001,131,0002,113,536
9May 20, 2026 15:49120,604600,404,538589,838,0001,125,0002,113,536