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 listFeb 3, 2026 21:49olliecrowolliecrowScore: 213,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 21:49212,6821,064,511,3791,040,144,0001,998,0002,441,216
2Feb 3, 2026 21:49213,0771,076,701,4831,040,082,0003,996,0002,424,832
3Feb 3, 2026 21:49213,2311,076,067,4781,041,832,0002,999,0002,433,024
4Feb 3, 2026 21:49213,6071,067,731,6411,043,673,0002,999,0002,424,832
5Feb 3, 2026 21:49213,6681,078,642,1861,043,975,0002,999,0002,428,928
6Feb 3, 2026 21:49213,8461,068,905,7581,046,847,000999,0002,437,120
7Feb 3, 2026 21:49214,9671,075,338,9881,050,341,0002,998,0002,273,280
8Feb 3, 2026 21:49215,0011,081,647,7291,050,505,0002,998,0002,428,928
9Feb 3, 2026 21:49215,3401,079,193,5451,051,171,0003,996,0002,400,256