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 listJul 14, 2026 00:15boop34boop34Score: 19,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 00:1519,844174,398,979163,685,0001,028,0002,113,536
2Jul 14, 2026 00:1519,845174,366,170163,696,0001,022,0002,113,536
3Jul 14, 2026 00:1519,846174,461,836163,683,0001,046,0002,113,536
4Jul 14, 2026 00:1519,846174,375,859163,681,0001,042,0002,113,536
5Jul 14, 2026 00:1519,847174,422,649163,686,0001,051,0002,113,536
6Jul 14, 2026 00:1519,847174,429,250163,705,0001,033,0002,113,536
7Jul 14, 2026 00:1519,867175,087,379163,836,0001,066,0002,113,536
8Jul 14, 2026 00:1519,875175,356,830163,961,0001,004,0002,113,536
9Jul 14, 2026 00:1520,391180,577,087168,239,0001,011,0002,113,536