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 3, 2026 19:42Josu San MartinJosu San MartinScore: 29,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 19:4328,976150,433,807140,736,0001,250,0002,113,536
2Aug 3, 2026 19:4328,994150,464,703140,817,0001,257,0002,113,536
3Aug 3, 2026 19:4329,004150,574,202141,076,0001,046,0002,113,536
4Aug 3, 2026 19:4329,011150,623,926140,887,0001,267,0002,113,536
5Aug 3, 2026 19:4329,012151,207,512141,087,0001,074,0002,113,536
6Aug 3, 2026 19:4329,013151,274,935140,900,0001,268,0002,113,536
7Aug 3, 2026 19:4329,056150,830,026141,315,0001,063,0002,113,536
8Aug 3, 2026 19:4329,069150,901,014141,423,0001,016,0002,113,536
9Aug 3, 2026 19:4329,312152,114,924142,577,0001,052,0002,113,536