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 19:34Josu San MartinJosu San MartinScore: 29,837Success
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 19:3529,805156,832,490144,933,0001,115,0002,113,536
2Aug 2, 2026 19:3529,809156,827,785144,935,0001,130,0002,113,536
3Aug 2, 2026 19:3529,819156,193,163144,995,0001,121,0002,113,536
4Aug 2, 2026 19:3529,824156,958,238145,008,0001,133,0002,113,536
5Aug 2, 2026 19:3529,837157,056,836145,086,0001,118,0002,113,536
6Aug 2, 2026 19:3529,844156,267,559145,108,0001,128,0002,113,536
7Aug 2, 2026 19:3530,234159,021,068147,019,0001,129,0002,113,536
8Aug 2, 2026 19:3530,251164,320,534147,059,0001,171,0002,117,632
9Aug 2, 2026 19:3530,537160,401,644148,494,0001,140,0002,113,536