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 16:52Josu San MartinJosu San MartinScore: 30,038Success
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 16:5329,760156,568,863144,705,0001,119,0002,113,536
2Aug 2, 2026 16:5329,769155,940,413144,746,0001,126,0002,113,536
3Aug 2, 2026 16:5329,788156,000,016144,822,0001,142,0002,113,536
4Aug 2, 2026 16:5329,792156,871,292144,839,0001,143,0002,113,536
5Aug 2, 2026 16:5330,038158,047,838146,055,0001,136,0002,113,536
6Aug 2, 2026 16:5330,059157,292,398146,160,0001,131,0002,113,536
7Aug 2, 2026 16:5330,105157,466,299146,411,0001,104,0002,113,536
8Aug 2, 2026 16:5330,194158,026,704146,827,0001,128,0002,113,536
9Aug 2, 2026 16:5331,669165,225,901154,073,0001,107,0002,113,536