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 27, 2026 00:19Code HintsCode HintsScore: 7,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 00:197,24169,057,21258,070,0002,036,0002,113,536
2Jun 27, 2026 00:197,25767,993,97158,201,0002,036,0002,113,536
3Jun 27, 2026 00:197,28367,946,84557,377,0003,076,0002,113,536
4Jun 27, 2026 00:197,29468,201,07757,511,0003,030,0002,113,536
5Jun 27, 2026 00:197,30568,135,78457,549,0003,084,0002,113,536
6Jun 27, 2026 00:197,33468,555,10657,864,0003,011,0002,113,536
7Jun 27, 2026 00:197,36968,642,68058,044,0003,120,0002,113,536
8Jun 27, 2026 00:197,43269,159,03358,672,0003,020,0002,113,536
9Jun 27, 2026 00:198,52778,344,80967,629,0003,152,0002,113,536