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 15, 2026 15:02limanjun99limanjun99Score: 156,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 15:02153,010773,260,223746,749,0002,998,0002,289,664
2Mar 15, 2026 15:02155,172789,289,315757,344,0002,997,0002,277,376
3Mar 15, 2026 15:02155,592787,928,993759,405,0002,997,0002,273,280
4Mar 15, 2026 15:02156,510792,954,244763,900,0002,999,0002,273,280
5Mar 15, 2026 15:02156,840794,397,488765,517,0002,998,0002,289,664
6Mar 15, 2026 15:02157,384802,109,136768,184,0002,996,0002,273,280
7Mar 15, 2026 15:02157,598802,050,613769,235,0002,997,0002,289,664
8Mar 15, 2026 15:02159,081806,463,954776,497,0002,998,0002,289,664
9Mar 15, 2026 15:02159,817809,724,712781,108,0001,997,0002,289,664