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 4, 2026 00:07Josu San MartinJosu San MartinScore: 28,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 00:0828,002145,675,910136,029,0001,185,0002,113,536
2Aug 4, 2026 00:0828,021149,665,576136,105,0001,202,0002,117,632
3Aug 4, 2026 00:0828,026145,769,160136,074,0001,257,0002,113,536
4Aug 4, 2026 00:0828,035145,593,535136,345,0001,030,0002,113,536
5Aug 4, 2026 00:0828,059145,872,743136,314,0001,179,0002,113,536
6Aug 4, 2026 00:0828,064145,752,973136,242,0001,273,0002,113,536
7Aug 4, 2026 00:0828,085146,018,736136,357,0001,260,0002,113,536
8Aug 4, 2026 00:0828,103145,921,607136,628,0001,077,0002,113,536
9Aug 4, 2026 00:0828,199147,193,346136,904,0001,273,0002,113,536