Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJun 19, 2026 07:06Victor MerckléVictor MerckléScore: 4,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 07:074,50145,016,95536,289,0001,076,0002,113,536
2Jun 19, 2026 07:074,50245,032,64436,323,0001,049,0002,113,536
3Jun 19, 2026 07:074,50745,003,83036,341,0001,071,0002,113,536
4Jun 19, 2026 07:074,51145,461,93936,371,0001,072,0002,113,536
5Jun 19, 2026 07:074,51846,192,31336,461,0001,046,0002,113,536
6Jun 19, 2026 07:074,53145,187,65836,609,0001,003,0002,113,536
7Jun 19, 2026 07:074,55445,387,18836,671,0001,131,0002,113,536
8Jun 19, 2026 07:074,72346,622,48638,142,0001,062,0002,113,536
9Jun 19, 2026 07:074,72646,842,81438,159,0001,075,0002,113,536