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 listApr 12, 2026 18:39Yuriy LyfenkoYuriy LyfenkoScore: 63,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 18:3961,550329,823,266299,596,0001,997,0002,269,184
2Apr 12, 2026 17:0261,569328,289,954299,691,0001,997,0002,510,848
3Apr 12, 2026 17:0261,610327,529,317298,892,0002,998,0002,506,752
4Apr 12, 2026 18:3963,182339,656,433306,598,0002,996,0002,510,848
5Apr 12, 2026 17:0263,203336,515,050306,697,0002,997,0002,510,848
6Apr 12, 2026 18:3963,218331,823,033307,770,0001,998,0002,289,664