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 18, 2026 01:12M-RochatM-RochatScore: 122,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:13119,286594,017,923583,359,0001,145,0002,113,536
2May 18, 2026 01:13120,906604,605,901591,300,0001,141,0002,113,536
3May 18, 2026 01:13121,256604,793,276593,029,0001,128,0002,113,536
4May 18, 2026 01:13121,326606,984,612593,346,0001,155,0002,113,536
5May 18, 2026 01:13122,742610,876,964600,310,0001,130,0002,113,536
6May 18, 2026 01:13122,878614,380,453600,976,0001,131,0002,113,536
7May 18, 2026 01:13123,336614,781,372603,210,0001,141,0002,113,536
8May 18, 2026 01:13124,388619,551,968608,363,0001,141,0002,113,536
9May 18, 2026 01:13124,572621,024,108609,257,0001,148,0002,113,536