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 listMay 13, 2026 11:45Victor MerckléVictor MerckléScore: 7,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 11:457,91774,837,27765,712,00002,113,536
2May 13, 2026 11:457,92073,166,76264,732,0001,008,0002,113,536
3May 13, 2026 11:457,92373,429,79564,740,0001,023,0002,113,536
4May 13, 2026 11:457,92375,249,99864,715,0001,049,0002,113,536
5May 13, 2026 11:457,92476,001,75264,756,0001,017,0002,113,536
6May 13, 2026 11:457,92873,113,54564,778,0001,027,0002,113,536
7May 13, 2026 11:457,93073,315,59064,793,0001,029,0002,113,536
8May 13, 2026 11:457,93173,176,71064,777,0001,057,0002,113,536
9May 13, 2026 11:457,93574,930,78264,850,0001,018,0002,113,536