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 listMar 21, 2026 15:53Dominique GarmierDominique GarmierScore: 1,364,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 15:531,342,00613,600,395,1653,906,746,0002,669,085,0002,465,792
2Mar 21, 2026 15:531,364,82416,135,582,2694,282,408,0002,405,229,000397,312
3Mar 21, 2026 15:531,369,20017,259,290,5414,275,603,0002,433,476,000401,408