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 listJan 21, 2026 02:56Josu San MartinJosu San MartinScore: 119,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2026 02:56119,500613,801,425582,554,0002,997,0002,281,472
2Jan 21, 2026 02:56119,508612,258,256583,589,0001,998,0002,424,832
3Jan 21, 2026 02:56119,580615,642,684582,944,0002,999,0002,453,504
4Jan 21, 2026 02:56119,589614,121,348580,989,0004,999,0002,465,792
5Jan 21, 2026 02:56119,601613,447,880581,043,0005,000,0002,281,472
6Jan 21, 2026 02:56119,630614,532,676582,184,0004,001,0002,281,472
7Jan 21, 2026 02:56119,654620,433,860582,305,0004,002,0002,281,472
8Jan 21, 2026 02:56119,699613,098,136583,528,0002,997,0002,465,792
9Jan 21, 2026 02:56119,709618,602,691582,578,0003,997,0002,281,472