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 listJun 30, 2026 14:48Victor MerckléVictor MerckléScore: 50,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:4950,395254,780,578244,903,0002,034,0002,117,632stderr
2Jun 30, 2026 14:4950,455254,921,572245,166,0002,067,0002,117,632stderr
3Jun 30, 2026 14:4950,470255,216,036245,242,0002,063,0002,117,632stderr
4Jun 30, 2026 14:4950,487255,362,379245,359,0002,029,0002,117,632stderr
5Jun 30, 2026 14:4950,568255,697,284245,752,0002,032,0002,117,632stderr
6Jun 30, 2026 14:4950,589255,878,152245,834,0002,055,0002,117,632stderr
7Jun 30, 2026 14:4950,656255,904,405246,150,0002,065,0002,117,632stderr
8Jun 30, 2026 14:4950,924257,180,715247,483,0002,047,0002,117,632stderr
9Jun 30, 2026 14:4950,967258,012,546247,670,0002,071,0002,117,632stderr