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 21:25Josu San MartinJosu San MartinScore: 29,704Success
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 21:2529,690156,341,194144,364,0001,119,0002,113,536
2Aug 2, 2026 21:2529,690155,519,608144,357,0001,126,0002,113,536
3Aug 2, 2026 21:2529,694155,532,516144,395,0001,109,0002,113,536
4Aug 2, 2026 21:2529,698156,242,103144,391,0001,130,0002,113,536
5Aug 2, 2026 21:2529,704156,298,399144,405,0001,146,0002,113,536
6Aug 2, 2026 21:2529,714155,668,777144,471,0001,130,0002,113,536
7Aug 2, 2026 21:2529,727155,740,324144,543,0001,123,0002,113,536
8Aug 2, 2026 21:2529,769155,967,857144,753,0001,116,0002,113,536
9Aug 2, 2026 21:2530,066157,403,774146,207,0001,120,0002,113,536