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 listAug 28, 2026 23:52Josu San MartinJosu San MartinScore: 25,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 23:5325,174131,713,055122,101,0001,256,0002,113,536
2Aug 28, 2026 23:5325,175131,826,969122,097,0001,261,0002,113,536
3Aug 28, 2026 23:5325,176131,803,164122,103,0001,262,0002,113,536
4Aug 28, 2026 23:5325,185131,857,159122,148,0001,262,0002,113,536
5Aug 28, 2026 23:5325,190131,855,714122,161,0001,272,0002,113,536
6Aug 28, 2026 23:5325,191131,868,499122,420,0001,016,0002,113,536
7Aug 28, 2026 23:5325,507133,356,152123,733,0001,255,0002,113,536
8Aug 28, 2026 23:5325,661134,154,710124,534,0001,206,0002,113,536
9Aug 28, 2026 23:5325,984136,353,023126,073,0001,251,0002,113,536