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 listAug 27, 2026 17:04Victor MerckléVictor MerckléScore: 4,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:044,49646,421,59236,067,0001,250,0002,113,536
2Aug 27, 2026 17:044,50645,770,07636,318,0001,090,0002,113,536
3Aug 27, 2026 17:044,53945,984,30736,586,0001,091,0002,113,536
4Aug 27, 2026 17:044,54445,965,15436,659,0001,062,0002,113,536
5Aug 27, 2026 17:044,58346,249,94636,919,0001,123,0002,113,536
6Aug 27, 2026 17:044,68847,153,50237,870,0001,043,0002,113,536
7Aug 27, 2026 17:044,72447,536,51038,166,0001,050,0002,113,536
8Aug 27, 2026 17:044,74849,095,19538,328,0001,084,0002,113,536
9Aug 27, 2026 17:044,81449,036,19538,878,0001,079,0002,113,536