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 20:26Josu San MartinJosu San MartinScore: 25,247Success
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 20:2625,213131,937,109122,300,0001,246,0002,113,536
2Aug 28, 2026 20:2625,225131,999,073122,339,0001,264,0002,113,536
3Aug 28, 2026 20:2625,244132,135,301122,436,0001,262,0002,113,536
4Aug 28, 2026 20:2625,244132,102,544122,454,0001,245,0002,113,536
5Aug 28, 2026 20:2625,247132,108,903122,447,0001,267,0002,113,536
6Aug 28, 2026 20:2625,260132,198,949122,522,0001,256,0002,113,536
7Aug 28, 2026 20:2625,295132,357,225122,941,0001,006,0002,113,536
8Aug 28, 2026 20:2625,579133,738,733124,077,0001,263,0002,113,536
9Aug 28, 2026 20:2625,961135,586,625125,952,0001,257,0002,113,536