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 16, 2026 07:18M-RochatM-RochatScore: 211,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 07:19210,8121,042,521,8101,030,974,0002,006,0002,113,536
2May 16, 2026 07:19210,8221,041,929,9331,031,021,0002,010,0002,113,536
3May 16, 2026 07:19211,1341,044,095,2691,032,520,0002,039,0002,113,536
4May 16, 2026 07:19211,1451,044,336,4301,032,606,0002,006,0002,113,536
5May 16, 2026 07:19211,4381,044,923,6571,033,898,0002,152,0002,113,536
6May 16, 2026 07:19211,5371,047,224,2181,034,429,0002,107,0002,113,536
7May 16, 2026 07:19215,3531,065,974,6691,053,132,0002,099,0002,113,536
8May 16, 2026 07:19215,3641,065,029,2991,053,173,0002,112,0002,113,536
9May 16, 2026 07:19215,4291,064,438,5841,053,602,0002,004,0002,113,536