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 2, 2026 23:56Josu San MartinJosu San MartinScore: 29,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 23:5629,373152,893,617142,657,0001,275,0002,113,536
2Aug 2, 2026 23:5629,389152,435,857142,744,0001,264,0002,113,536
3Aug 2, 2026 23:5629,402152,592,443142,790,0001,281,0002,113,536
4Aug 2, 2026 23:5629,406152,481,624142,825,0001,266,0002,113,536
5Aug 2, 2026 23:5629,412153,241,236142,850,0001,273,0002,113,536
6Aug 2, 2026 23:5629,413153,206,398143,108,0001,017,0002,113,536
7Aug 2, 2026 23:5629,428152,665,517142,924,0001,275,0002,113,536
8Aug 2, 2026 23:5629,610153,308,059144,039,0001,054,0002,113,536
9Aug 2, 2026 23:5629,809155,099,582144,982,0001,086,0002,113,536