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 29, 2026 03:12Josu San MartinJosu San MartinScore: 24,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 03:1224,203127,002,512117,331,0001,264,0002,113,536
2Aug 29, 2026 03:1224,204127,688,323117,354,0001,248,0002,113,536
3Aug 29, 2026 03:1224,206127,554,698117,348,0001,266,0002,113,536
4Aug 29, 2026 03:1224,207127,018,534117,370,0001,249,0002,113,536
5Aug 29, 2026 03:1224,388127,928,233118,319,0001,186,0002,113,536
6Aug 29, 2026 03:1225,456133,724,393123,496,0001,241,0002,113,536
7Aug 29, 2026 03:1225,457133,181,288123,478,0001,263,0002,113,536
8Aug 29, 2026 03:1226,447137,994,671128,341,0001,254,0002,113,536
9Aug 29, 2026 03:1226,448138,062,766128,334,0001,266,0002,113,536