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 7, 2026 16:37Pavel SkripkinPavel SkripkinScore: 134,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 16:37133,956671,999,587654,330,0002,055,0002,420,736
2May 7, 2026 16:37133,976671,659,683654,441,0002,046,0002,424,832
3May 7, 2026 16:37133,982671,755,901654,429,0002,087,0002,412,544
4May 7, 2026 16:37133,984674,551,850654,358,0002,164,0002,408,448
5May 7, 2026 16:37134,035673,235,809654,668,0002,106,0002,412,544
6May 7, 2026 16:37134,037668,963,909654,659,0002,126,0002,404,352
7May 7, 2026 16:37134,046671,951,453654,575,0002,253,0002,314,240
8May 7, 2026 16:37134,095672,703,069654,966,0002,103,0002,420,736
9May 7, 2026 16:37134,143672,900,183654,195,0003,109,0002,412,544