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 01:27avoidcatenjoyersavoidcatenjoyersScore: 103,205Success
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 01:27103,096867,380,626797,968,00057,735,0002,113,536
2May 20, 2026 01:27103,123866,091,493798,359,00057,566,0002,113,536
3May 20, 2026 01:27103,136866,115,364797,874,00058,155,0002,113,536
4May 20, 2026 01:27103,198866,771,803798,895,00057,653,0002,113,536
5May 20, 2026 01:27103,205867,729,822798,717,00057,892,0002,113,536
6May 20, 2026 01:27103,228868,025,958798,766,00058,034,0002,113,536
7May 20, 2026 01:27103,230869,068,539798,791,00058,025,0002,113,536
8May 20, 2026 01:27103,252868,613,404798,943,00058,054,0002,113,536
9May 20, 2026 01:27103,314868,111,243798,793,00058,715,0002,113,536