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 listNov 20, 2024 01:21zielajzielajScore: 4,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 01:214,04055,818,75932,516,0001,016,0002,269,184
2Nov 20, 2024 01:214,08752,629,34432,921,000997,0002,461,696
3Nov 20, 2024 01:214,10955,735,78833,101,0001,003,0002,379,776
4Nov 20, 2024 01:214,20459,335,65432,898,0001,993,0002,531,328
5Nov 20, 2024 01:214,20558,689,57732,908,0001,994,0002,277,376
6Nov 20, 2024 01:214,21759,788,34232,998,0001,999,0002,408,448