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 listOct 12, 2026 20:36Karthik ReddyKarthik ReddyScore: 24,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 20:3724,114127,096,946117,115,0001,044,00020,480
2Oct 12, 2026 20:3724,127127,153,045117,176,0001,049,00020,480
3Oct 12, 2026 20:3724,130127,141,355117,161,0001,077,00020,480
4Oct 12, 2026 20:3724,132127,173,439117,181,0001,066,00020,480
5Oct 12, 2026 20:3724,158127,333,189117,317,0001,061,00020,480
6Oct 12, 2026 20:3724,174127,383,769117,362,0001,091,00020,480
7Oct 12, 2026 20:3724,189128,413,738117,469,0001,060,00020,480
8Oct 12, 2026 20:3724,191127,503,237117,474,0001,062,00020,480
9Oct 12, 2026 20:3724,199127,483,694117,470,0001,106,00020,480