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 listSep 13, 2026 16:12Kita RenjiKita RenjiScore: 6,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 16:126,77066,326,41755,173,0001,018,0002,113,536
2Sep 13, 2026 16:126,78766,534,41654,321,0002,017,0002,113,536
3Sep 13, 2026 16:126,79366,520,22454,376,0002,011,0002,113,536
4Sep 13, 2026 16:126,80266,596,33355,440,0001,018,0002,113,536
5Sep 13, 2026 16:126,81166,669,19554,524,0002,012,0002,113,536
6Sep 13, 2026 16:126,83166,869,50855,685,0001,018,0002,113,536
7Sep 13, 2026 16:126,86567,057,66154,977,0002,009,0002,113,536
8Sep 13, 2026 16:126,91767,569,26455,232,0002,183,0002,113,536
9Sep 13, 2026 16:126,94667,734,75255,601,0002,052,0002,113,536