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 22:17Maya RebholzMaya RebholzScore: 9,461Success
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 22:189,45287,905,86676,290,0002,163,0002,113,536
2May 20, 2026 22:189,45288,214,21376,282,0002,170,0002,113,536
3May 20, 2026 22:189,45389,133,86976,285,0002,181,0002,113,536
4May 20, 2026 22:189,45689,718,75476,291,0002,200,0002,113,536
5May 20, 2026 22:189,46187,983,77176,364,0002,166,0002,113,536
6May 20, 2026 22:189,46290,125,21976,342,0002,197,0002,113,536
7May 20, 2026 22:189,46389,940,58076,369,0002,176,0002,113,536
8May 20, 2026 22:189,46488,037,26176,310,0002,245,0002,113,536
9May 20, 2026 22:189,46588,511,26476,308,0002,255,0002,113,536