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 20, 2026 10:12M-RochatM-RochatScore: 6,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:126,77068,798,04654,142,0002,057,0002,113,536
2May 20, 2026 10:126,82067,905,53654,537,0002,077,0002,113,536
3May 20, 2026 10:126,82866,112,99554,510,0002,165,0002,113,536
4May 20, 2026 10:126,83867,903,85854,625,0002,136,0002,113,536
5May 20, 2026 10:126,84066,762,93954,610,0002,166,0002,113,536
6May 20, 2026 10:126,85367,642,42654,699,0002,183,0002,113,536
7May 20, 2026 10:126,85568,096,04154,749,0002,154,0002,113,536
8May 20, 2026 10:126,85668,737,04054,726,0002,180,0002,113,536
9May 20, 2026 10:126,87569,654,88254,881,0002,182,0002,113,536