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 28, 2026 14:19Dominique GarmierDominique GarmierScore: 1,481,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 12:171,480,8427,284,366,9667,255,125,000999,0002,277,376
2Mar 28, 2026 14:191,480,9777,282,456,0807,255,788,000999,0002,277,376
3Mar 28, 2026 12:171,481,0877,291,690,9247,256,329,000999,0002,273,280
4Mar 28, 2026 14:191,481,6987,296,001,6147,259,321,000999,0002,277,376
5Mar 28, 2026 14:191,482,1307,294,199,9567,260,440,0001,998,0002,473,984
6Mar 28, 2026 12:171,482,6747,297,866,7267,264,102,000999,0002,277,376