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 9, 2025 00:41Leon ZhaoLeon ZhaoScore: 16,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 00:4116,747164,920,503136,999,0001,999,0002,469,888
2Aug 9, 2025 00:4116,781160,482,006138,284,0001,002,0002,285,568
3Aug 9, 2025 00:4116,786165,839,294138,321,0001,002,0002,285,568
4Aug 9, 2025 00:4116,786165,147,574137,321,0002,004,0002,285,568
5Aug 9, 2025 00:4116,791161,929,296139,364,00002,473,984
6Aug 9, 2025 00:4116,800162,220,212138,439,0001,003,0002,285,568
7Aug 9, 2025 00:4116,801159,544,977138,448,0001,003,0002,285,568
8Aug 9, 2025 00:4116,802165,819,937137,453,0002,006,0002,510,848
9Aug 9, 2025 00:4116,803166,489,565138,464,0001,003,0002,461,696